java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:16:10,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:16:10,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:16:10,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:16:10,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:16:10,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:16:10,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:16:10,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:16:10,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:16:10,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:16:10,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:16:10,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:16:10,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:16:10,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:16:10,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:16:10,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:16:10,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:16:10,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:16:10,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:16:10,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:16:10,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:16:10,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:16:10,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:16:10,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:16:10,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:16:10,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:16:10,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:16:10,872 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:16:10,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:16:10,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:16:10,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:16:10,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:16:10,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:16:10,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:16:10,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:16:10,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:16:10,877 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:16:10,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:16:10,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:16:10,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:16:10,894 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:16:10,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:16:10,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:16:10,895 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:16:10,895 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:16:10,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:16:10,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:16:10,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:16:10,967 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:16:10,968 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:16:10,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-07-25 13:16:10,969 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-07-25 13:16:11,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:16:11,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:16:11,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:16:11,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:16:11,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:16:11,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,067 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:16:11,067 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:16:11,067 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:16:11,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:16:11,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:16:11,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:16:11,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:16:11,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:16:11,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:16:11,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:16:11,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:16:11,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/1) ... [2018-07-25 13:16:11,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 13:16:11,179 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 13:16:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 13:16:11,348 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:16:11,349 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:16:11 BoogieIcfgContainer [2018-07-25 13:16:11,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:16:11,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:16:11,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:16:11,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:16:11,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:16:11" (1/2) ... [2018-07-25 13:16:11,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b505166 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:16:11, skipping insertion in model container [2018-07-25 13:16:11,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:16:11" (2/2) ... [2018-07-25 13:16:11,359 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-07-25 13:16:11,370 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:16:11,379 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-25 13:16:11,432 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:16:11,433 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:16:11,433 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:16:11,433 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:16:11,434 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:16:11,434 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:16:11,434 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:16:11,434 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:16:11,434 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:16:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-07-25 13:16:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:16:11,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:11,467 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:16:11,471 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-07-25 13:16:11,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:11,602 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:11,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:16:11,608 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:16:11,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:16:11,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:11,628 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-07-25 13:16:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:11,908 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-07-25 13:16:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:16:11,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:16:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:11,924 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:16:11,924 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:16:11,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:16:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-07-25 13:16:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:16:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-07-25 13:16:11,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-07-25 13:16:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:11,976 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-07-25 13:16:11,977 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:16:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-07-25 13:16:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:16:11,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:11,981 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:16:11,981 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-07-25 13:16:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,023 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:12,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:16:12,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:16:12,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:16:12,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:12,026 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-07-25 13:16:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,186 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-07-25 13:16:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:16:12,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:16:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,188 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:16:12,188 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:16:12,190 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:16:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-07-25 13:16:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:16:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-07-25 13:16:12,207 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-07-25 13:16:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,208 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-07-25 13:16:12,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:16:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-07-25 13:16:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:16:12,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,212 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 13:16:12,213 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-07-25 13:16:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,255 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:12,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:16:12,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:16:12,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:16:12,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:12,257 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-07-25 13:16:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,447 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-07-25 13:16:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:12,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:16:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,448 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:16:12,449 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:16:12,453 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:16:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-07-25 13:16:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:16:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-07-25 13:16:12,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-07-25 13:16:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,473 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-07-25 13:16:12,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:16:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-07-25 13:16:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:16:12,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,474 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 13:16:12,474 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-07-25 13:16:12,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,493 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:12,493 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:16:12,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:16:12,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:16:12,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:16:12,495 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-07-25 13:16:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,609 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-07-25 13:16:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:16:12,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:16:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,611 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:16:12,611 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:16:12,612 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:16:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-07-25 13:16:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:16:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-07-25 13:16:12,629 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-07-25 13:16:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,629 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-07-25 13:16:12,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:16:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-07-25 13:16:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:12,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,631 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:12,631 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-07-25 13:16:12,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:12,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:12,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:12,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:12,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:12,718 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 8 states. [2018-07-25 13:16:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,933 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-07-25 13:16:12,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:12,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,938 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:16:12,938 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:16:12,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:16:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-07-25 13:16:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:16:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions. [2018-07-25 13:16:12,975 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 8 [2018-07-25 13:16:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,976 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 100 transitions. [2018-07-25 13:16:12,976 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 100 transitions. [2018-07-25 13:16:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:12,977 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,977 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:12,978 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-07-25 13:16:12,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,012 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:13,012 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:13,013 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:13,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:13,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:13,014 INFO L87 Difference]: Start difference. First operand 59 states and 100 transitions. Second operand 8 states. [2018-07-25 13:16:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,188 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2018-07-25 13:16:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:13,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,193 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:16:13,194 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:16:13,197 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:16:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-07-25 13:16:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:16:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2018-07-25 13:16:13,236 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 8 [2018-07-25 13:16:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,236 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2018-07-25 13:16:13,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2018-07-25 13:16:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:13,237 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,238 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,238 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-07-25 13:16:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:13,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:13,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:13,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:13,280 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 8 states. [2018-07-25 13:16:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,425 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-07-25 13:16:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:13,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,426 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:16:13,427 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:16:13,427 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:16:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2018-07-25 13:16:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:16:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions. [2018-07-25 13:16:13,461 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 8 [2018-07-25 13:16:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,461 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions. [2018-07-25 13:16:13,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions. [2018-07-25 13:16:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:13,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,463 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,464 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-07-25 13:16:13,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,485 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:13,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:13,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:13,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:13,487 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand 8 states. [2018-07-25 13:16:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,603 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2018-07-25 13:16:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:13,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,605 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:16:13,605 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:16:13,606 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:16:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-07-25 13:16:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:16:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 144 transitions. [2018-07-25 13:16:13,634 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 144 transitions. Word has length 8 [2018-07-25 13:16:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,634 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 144 transitions. [2018-07-25 13:16:13,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions. [2018-07-25 13:16:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:13,636 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,636 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,636 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times [2018-07-25 13:16:13,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:16:13,654 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:13,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:13,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:13,655 INFO L87 Difference]: Start difference. First operand 83 states and 144 transitions. Second operand 7 states. [2018-07-25 13:16:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,771 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2018-07-25 13:16:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:13,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:16:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,772 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:16:13,773 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:16:13,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:16:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-07-25 13:16:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:16:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 147 transitions. [2018-07-25 13:16:13,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 147 transitions. Word has length 8 [2018-07-25 13:16:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,809 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 147 transitions. [2018-07-25 13:16:13,809 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 147 transitions. [2018-07-25 13:16:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:13,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,813 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,814 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-07-25 13:16:13,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:13,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:13,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:13,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:13,849 INFO L87 Difference]: Start difference. First operand 85 states and 147 transitions. Second operand 8 states. [2018-07-25 13:16:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,007 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2018-07-25 13:16:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:14,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,009 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:16:14,009 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:16:14,010 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:16:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-07-25 13:16:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:16:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2018-07-25 13:16:14,040 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 151 transitions. Word has length 8 [2018-07-25 13:16:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:14,040 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 151 transitions. [2018-07-25 13:16:14,040 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 151 transitions. [2018-07-25 13:16:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:14,041 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:14,042 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:14,042 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-07-25 13:16:14,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:14,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:14,063 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:14,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:14,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:14,064 INFO L87 Difference]: Start difference. First operand 87 states and 151 transitions. Second operand 8 states. [2018-07-25 13:16:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,209 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2018-07-25 13:16:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:14,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,212 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:16:14,212 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:16:14,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:16:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2018-07-25 13:16:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:16:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-07-25 13:16:14,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 8 [2018-07-25 13:16:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:14,250 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-07-25 13:16:14,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-07-25 13:16:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:14,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:14,252 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:14,252 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:14,253 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-07-25 13:16:14,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:14,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:16:14,269 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:14,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:14,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:14,270 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 7 states. [2018-07-25 13:16:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,417 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-25 13:16:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:14,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:16:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,419 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:16:14,420 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:16:14,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:16:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-07-25 13:16:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:16:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 178 transitions. [2018-07-25 13:16:14,462 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 178 transitions. Word has length 8 [2018-07-25 13:16:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:14,463 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 178 transitions. [2018-07-25 13:16:14,463 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 178 transitions. [2018-07-25 13:16:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:14,464 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:14,464 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:14,465 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-07-25 13:16:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,484 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:14,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:14,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:14,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:14,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:14,485 INFO L87 Difference]: Start difference. First operand 102 states and 178 transitions. Second operand 8 states. [2018-07-25 13:16:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,659 INFO L93 Difference]: Finished difference Result 150 states and 251 transitions. [2018-07-25 13:16:14,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:14,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:16:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,661 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:16:14,662 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:16:14,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:16:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2018-07-25 13:16:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:16:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2018-07-25 13:16:14,718 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 8 [2018-07-25 13:16:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:14,719 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-07-25 13:16:14,719 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2018-07-25 13:16:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:14,720 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:14,720 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:14,721 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-07-25 13:16:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,747 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:14,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:14,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:14,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:14,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:14,749 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 7 states. [2018-07-25 13:16:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,945 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions. [2018-07-25 13:16:14,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:14,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:16:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,947 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:16:14,947 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 13:16:14,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 13:16:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2018-07-25 13:16:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:16:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 233 transitions. [2018-07-25 13:16:15,004 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 233 transitions. Word has length 8 [2018-07-25 13:16:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,004 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 233 transitions. [2018-07-25 13:16:15,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 233 transitions. [2018-07-25 13:16:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:16:15,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,005 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,005 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-07-25 13:16:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,022 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:16:15,022 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:15,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:15,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:15,023 INFO L87 Difference]: Start difference. First operand 132 states and 233 transitions. Second operand 7 states. [2018-07-25 13:16:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:15,221 INFO L93 Difference]: Finished difference Result 235 states and 413 transitions. [2018-07-25 13:16:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:15,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:16:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:15,224 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:16:15,224 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:16:15,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:16:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-07-25 13:16:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:16:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 320 transitions. [2018-07-25 13:16:15,308 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 320 transitions. Word has length 8 [2018-07-25 13:16:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,308 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 320 transitions. [2018-07-25 13:16:15,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 320 transitions. [2018-07-25 13:16:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:16:15,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,310 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,310 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times [2018-07-25 13:16:15,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:15,338 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:15,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:15,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:15,339 INFO L87 Difference]: Start difference. First operand 179 states and 320 transitions. Second operand 8 states. [2018-07-25 13:16:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:15,554 INFO L93 Difference]: Finished difference Result 206 states and 368 transitions. [2018-07-25 13:16:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:15,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-07-25 13:16:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:15,556 INFO L225 Difference]: With dead ends: 206 [2018-07-25 13:16:15,557 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 13:16:15,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 13:16:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-07-25 13:16:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:16:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions. [2018-07-25 13:16:15,682 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 9 [2018-07-25 13:16:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,683 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions. [2018-07-25 13:16:15,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions. [2018-07-25 13:16:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:16:15,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,684 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,685 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times [2018-07-25 13:16:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:15,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:15,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:15,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:15,719 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 9 states. [2018-07-25 13:16:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,035 INFO L93 Difference]: Finished difference Result 266 states and 466 transitions. [2018-07-25 13:16:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:16,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:16:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,038 INFO L225 Difference]: With dead ends: 266 [2018-07-25 13:16:16,038 INFO L226 Difference]: Without dead ends: 264 [2018-07-25 13:16:16,039 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-25 13:16:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-07-25 13:16:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 13:16:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 402 transitions. [2018-07-25 13:16:16,144 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 402 transitions. Word has length 9 [2018-07-25 13:16:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,144 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 402 transitions. [2018-07-25 13:16:16,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 402 transitions. [2018-07-25 13:16:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:16,145 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,145 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:16,146 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-07-25 13:16:16,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:16,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:16,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:16,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:16,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:16,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:16,161 INFO L87 Difference]: Start difference. First operand 222 states and 402 transitions. Second operand 7 states. [2018-07-25 13:16:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,366 INFO L93 Difference]: Finished difference Result 264 states and 459 transitions. [2018-07-25 13:16:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:16,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,372 INFO L225 Difference]: With dead ends: 264 [2018-07-25 13:16:16,372 INFO L226 Difference]: Without dead ends: 262 [2018-07-25 13:16:16,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-25 13:16:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-07-25 13:16:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:16:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 420 transitions. [2018-07-25 13:16:16,475 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 420 transitions. Word has length 11 [2018-07-25 13:16:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,475 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 420 transitions. [2018-07-25 13:16:16,475 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 420 transitions. [2018-07-25 13:16:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:16,476 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,476 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:16,477 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000296, now seen corresponding path program 1 times [2018-07-25 13:16:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:16,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:16,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:16,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:16,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:16,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:16,501 INFO L87 Difference]: Start difference. First operand 231 states and 420 transitions. Second operand 9 states. [2018-07-25 13:16:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,665 INFO L93 Difference]: Finished difference Result 250 states and 439 transitions. [2018-07-25 13:16:16,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:16,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 13:16:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,667 INFO L225 Difference]: With dead ends: 250 [2018-07-25 13:16:16,667 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:16:16,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:16:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-07-25 13:16:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:16:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 419 transitions. [2018-07-25 13:16:16,757 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 419 transitions. Word has length 11 [2018-07-25 13:16:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,758 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 419 transitions. [2018-07-25 13:16:16,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 419 transitions. [2018-07-25 13:16:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:16,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,759 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:16,759 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-07-25 13:16:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:16,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:16,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:16,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:16,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:16,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:16,785 INFO L87 Difference]: Start difference. First operand 231 states and 419 transitions. Second operand 9 states. [2018-07-25 13:16:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,055 INFO L93 Difference]: Finished difference Result 278 states and 490 transitions. [2018-07-25 13:16:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:17,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 13:16:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,057 INFO L225 Difference]: With dead ends: 278 [2018-07-25 13:16:17,057 INFO L226 Difference]: Without dead ends: 276 [2018-07-25 13:16:17,058 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-07-25 13:16:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-07-25 13:16:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-25 13:16:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 439 transitions. [2018-07-25 13:16:17,159 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 439 transitions. Word has length 11 [2018-07-25 13:16:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,159 INFO L472 AbstractCegarLoop]: Abstraction has 242 states and 439 transitions. [2018-07-25 13:16:17,160 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 439 transitions. [2018-07-25 13:16:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:17,160 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,161 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,161 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times [2018-07-25 13:16:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:17,176 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:17,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:17,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:17,177 INFO L87 Difference]: Start difference. First operand 242 states and 439 transitions. Second operand 7 states. [2018-07-25 13:16:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,372 INFO L93 Difference]: Finished difference Result 300 states and 527 transitions. [2018-07-25 13:16:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:17,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,375 INFO L225 Difference]: With dead ends: 300 [2018-07-25 13:16:17,375 INFO L226 Difference]: Without dead ends: 298 [2018-07-25 13:16:17,375 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-25 13:16:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 267. [2018-07-25 13:16:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:16:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 484 transitions. [2018-07-25 13:16:17,478 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 484 transitions. Word has length 11 [2018-07-25 13:16:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,479 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 484 transitions. [2018-07-25 13:16:17,479 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 484 transitions. [2018-07-25 13:16:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:17,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,480 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,480 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 2 times [2018-07-25 13:16:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:17,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:17,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:17,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:17,506 INFO L87 Difference]: Start difference. First operand 267 states and 484 transitions. Second operand 9 states. [2018-07-25 13:16:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,747 INFO L93 Difference]: Finished difference Result 334 states and 589 transitions. [2018-07-25 13:16:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:17,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 13:16:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,750 INFO L225 Difference]: With dead ends: 334 [2018-07-25 13:16:17,750 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 13:16:17,751 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 13:16:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2018-07-25 13:16:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-07-25 13:16:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 512 transitions. [2018-07-25 13:16:17,867 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 512 transitions. Word has length 11 [2018-07-25 13:16:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,867 INFO L472 AbstractCegarLoop]: Abstraction has 282 states and 512 transitions. [2018-07-25 13:16:17,867 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 512 transitions. [2018-07-25 13:16:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:17,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,868 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,868 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-07-25 13:16:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:17,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:17,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:17,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:17,889 INFO L87 Difference]: Start difference. First operand 282 states and 512 transitions. Second operand 8 states. [2018-07-25 13:16:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:18,206 INFO L93 Difference]: Finished difference Result 342 states and 604 transitions. [2018-07-25 13:16:18,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:18,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-25 13:16:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:18,208 INFO L225 Difference]: With dead ends: 342 [2018-07-25 13:16:18,209 INFO L226 Difference]: Without dead ends: 340 [2018-07-25 13:16:18,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-07-25 13:16:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2018-07-25 13:16:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-25 13:16:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 518 transitions. [2018-07-25 13:16:18,350 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 518 transitions. Word has length 11 [2018-07-25 13:16:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:18,350 INFO L472 AbstractCegarLoop]: Abstraction has 286 states and 518 transitions. [2018-07-25 13:16:18,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 518 transitions. [2018-07-25 13:16:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:18,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:18,352 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:18,352 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 285598401, now seen corresponding path program 1 times [2018-07-25 13:16:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:18,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:18,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:18,378 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:18,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:18,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:18,378 INFO L87 Difference]: Start difference. First operand 286 states and 518 transitions. Second operand 9 states. [2018-07-25 13:16:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:18,732 INFO L93 Difference]: Finished difference Result 300 states and 532 transitions. [2018-07-25 13:16:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:18,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 13:16:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:18,734 INFO L225 Difference]: With dead ends: 300 [2018-07-25 13:16:18,734 INFO L226 Difference]: Without dead ends: 298 [2018-07-25 13:16:18,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-25 13:16:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251. [2018-07-25 13:16:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:16:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 450 transitions. [2018-07-25 13:16:18,847 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 450 transitions. Word has length 11 [2018-07-25 13:16:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:18,847 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 450 transitions. [2018-07-25 13:16:18,847 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 450 transitions. [2018-07-25 13:16:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:18,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:18,848 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:18,849 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:18,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-07-25 13:16:18,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:18,875 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:18,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:18,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:18,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:18,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:18,877 INFO L87 Difference]: Start difference. First operand 251 states and 450 transitions. Second operand 8 states. [2018-07-25 13:16:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,087 INFO L93 Difference]: Finished difference Result 286 states and 493 transitions. [2018-07-25 13:16:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:19,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-25 13:16:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,089 INFO L225 Difference]: With dead ends: 286 [2018-07-25 13:16:19,089 INFO L226 Difference]: Without dead ends: 284 [2018-07-25 13:16:19,090 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-25 13:16:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 257. [2018-07-25 13:16:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:16:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 460 transitions. [2018-07-25 13:16:19,200 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 460 transitions. Word has length 11 [2018-07-25 13:16:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,200 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 460 transitions. [2018-07-25 13:16:19,201 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 460 transitions. [2018-07-25 13:16:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:19,201 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,201 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:19,202 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-07-25 13:16:19,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:19,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:19,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:19,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:19,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:19,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:19,219 INFO L87 Difference]: Start difference. First operand 257 states and 460 transitions. Second operand 7 states. [2018-07-25 13:16:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,424 INFO L93 Difference]: Finished difference Result 292 states and 503 transitions. [2018-07-25 13:16:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:19,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,427 INFO L225 Difference]: With dead ends: 292 [2018-07-25 13:16:19,427 INFO L226 Difference]: Without dead ends: 290 [2018-07-25 13:16:19,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-25 13:16:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2018-07-25 13:16:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-25 13:16:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 458 transitions. [2018-07-25 13:16:19,548 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 458 transitions. Word has length 11 [2018-07-25 13:16:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,549 INFO L472 AbstractCegarLoop]: Abstraction has 256 states and 458 transitions. [2018-07-25 13:16:19,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 458 transitions. [2018-07-25 13:16:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:19,550 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,550 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:19,550 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-07-25 13:16:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:19,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:19,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:19,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:19,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:19,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:19,571 INFO L87 Difference]: Start difference. First operand 256 states and 458 transitions. Second operand 7 states. [2018-07-25 13:16:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,831 INFO L93 Difference]: Finished difference Result 320 states and 559 transitions. [2018-07-25 13:16:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:19,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,835 INFO L225 Difference]: With dead ends: 320 [2018-07-25 13:16:19,835 INFO L226 Difference]: Without dead ends: 318 [2018-07-25 13:16:19,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-25 13:16:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2018-07-25 13:16:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:16:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 503 transitions. [2018-07-25 13:16:19,972 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 503 transitions. Word has length 11 [2018-07-25 13:16:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,972 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 503 transitions. [2018-07-25 13:16:19,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 503 transitions. [2018-07-25 13:16:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:19,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,974 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:19,974 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-07-25 13:16:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:19,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:19,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:19,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:19,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:19,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:19,992 INFO L87 Difference]: Start difference. First operand 281 states and 503 transitions. Second operand 7 states. [2018-07-25 13:16:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:20,242 INFO L93 Difference]: Finished difference Result 333 states and 581 transitions. [2018-07-25 13:16:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:20,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:20,245 INFO L225 Difference]: With dead ends: 333 [2018-07-25 13:16:20,245 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:16:20,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:16:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 285. [2018-07-25 13:16:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:16:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions. [2018-07-25 13:16:20,371 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 11 [2018-07-25 13:16:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:20,372 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions. [2018-07-25 13:16:20,372 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions. [2018-07-25 13:16:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:20,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:20,373 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:20,373 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-07-25 13:16:20,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:20,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:20,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:20,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:20,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:20,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:20,394 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand 7 states. [2018-07-25 13:16:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:20,668 INFO L93 Difference]: Finished difference Result 353 states and 620 transitions. [2018-07-25 13:16:20,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:20,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:20,671 INFO L225 Difference]: With dead ends: 353 [2018-07-25 13:16:20,671 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 13:16:20,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 13:16:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 306. [2018-07-25 13:16:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-07-25 13:16:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 547 transitions. [2018-07-25 13:16:20,820 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 547 transitions. Word has length 11 [2018-07-25 13:16:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:20,821 INFO L472 AbstractCegarLoop]: Abstraction has 306 states and 547 transitions. [2018-07-25 13:16:20,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 547 transitions. [2018-07-25 13:16:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:20,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:20,822 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:20,822 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-07-25 13:16:20,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:20,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:20,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:20,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:20,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:20,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:20,835 INFO L87 Difference]: Start difference. First operand 306 states and 547 transitions. Second operand 7 states. [2018-07-25 13:16:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,098 INFO L93 Difference]: Finished difference Result 331 states and 575 transitions. [2018-07-25 13:16:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:21,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,101 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:16:21,101 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:16:21,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:16:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300. [2018-07-25 13:16:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-07-25 13:16:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 534 transitions. [2018-07-25 13:16:21,264 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 534 transitions. Word has length 11 [2018-07-25 13:16:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,265 INFO L472 AbstractCegarLoop]: Abstraction has 300 states and 534 transitions. [2018-07-25 13:16:21,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 534 transitions. [2018-07-25 13:16:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:21,266 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,266 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:21,266 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-07-25 13:16:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:21,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:21,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:21,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:21,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:21,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:21,281 INFO L87 Difference]: Start difference. First operand 300 states and 534 transitions. Second operand 7 states. [2018-07-25 13:16:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,558 INFO L93 Difference]: Finished difference Result 354 states and 618 transitions. [2018-07-25 13:16:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:21,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,561 INFO L225 Difference]: With dead ends: 354 [2018-07-25 13:16:21,561 INFO L226 Difference]: Without dead ends: 352 [2018-07-25 13:16:21,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-25 13:16:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-07-25 13:16:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-25 13:16:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 510 transitions. [2018-07-25 13:16:21,688 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 510 transitions. Word has length 11 [2018-07-25 13:16:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,688 INFO L472 AbstractCegarLoop]: Abstraction has 286 states and 510 transitions. [2018-07-25 13:16:21,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 510 transitions. [2018-07-25 13:16:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:16:21,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,689 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:21,690 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-07-25 13:16:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:21,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:21,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:21,701 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:21,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:21,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:21,702 INFO L87 Difference]: Start difference. First operand 286 states and 510 transitions. Second operand 7 states. [2018-07-25 13:16:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,962 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2018-07-25 13:16:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:21,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 13:16:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,964 INFO L225 Difference]: With dead ends: 344 [2018-07-25 13:16:21,965 INFO L226 Difference]: Without dead ends: 342 [2018-07-25 13:16:21,965 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-25 13:16:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2018-07-25 13:16:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:16:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 496 transitions. [2018-07-25 13:16:22,102 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 496 transitions. Word has length 11 [2018-07-25 13:16:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:22,102 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 496 transitions. [2018-07-25 13:16:22,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 496 transitions. [2018-07-25 13:16:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:22,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:22,103 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:22,103 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1894600283, now seen corresponding path program 1 times [2018-07-25 13:16:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:22,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:22,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:22,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:22,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:22,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:22,122 INFO L87 Difference]: Start difference. First operand 279 states and 496 transitions. Second operand 7 states. [2018-07-25 13:16:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:22,369 INFO L93 Difference]: Finished difference Result 634 states and 1102 transitions. [2018-07-25 13:16:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:22,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:16:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:22,372 INFO L225 Difference]: With dead ends: 634 [2018-07-25 13:16:22,372 INFO L226 Difference]: Without dead ends: 356 [2018-07-25 13:16:22,374 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-25 13:16:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339. [2018-07-25 13:16:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:16:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 589 transitions. [2018-07-25 13:16:22,529 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 589 transitions. Word has length 12 [2018-07-25 13:16:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:22,530 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 589 transitions. [2018-07-25 13:16:22,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 589 transitions. [2018-07-25 13:16:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:22,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:22,531 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:22,531 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:22,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1217022044, now seen corresponding path program 1 times [2018-07-25 13:16:22,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:22,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:22,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:22,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:22,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:22,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:22,558 INFO L87 Difference]: Start difference. First operand 339 states and 589 transitions. Second operand 9 states. [2018-07-25 13:16:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:22,884 INFO L93 Difference]: Finished difference Result 433 states and 739 transitions. [2018-07-25 13:16:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:22,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:22,887 INFO L225 Difference]: With dead ends: 433 [2018-07-25 13:16:22,887 INFO L226 Difference]: Without dead ends: 431 [2018-07-25 13:16:22,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-07-25 13:16:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396. [2018-07-25 13:16:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-25 13:16:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 693 transitions. [2018-07-25 13:16:23,091 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 693 transitions. Word has length 12 [2018-07-25 13:16:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:23,092 INFO L472 AbstractCegarLoop]: Abstraction has 396 states and 693 transitions. [2018-07-25 13:16:23,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 693 transitions. [2018-07-25 13:16:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:23,093 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:23,093 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:23,093 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:23,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 2 times [2018-07-25 13:16:23,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:23,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:23,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:23,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:23,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:23,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:23,119 INFO L87 Difference]: Start difference. First operand 396 states and 693 transitions. Second operand 7 states. [2018-07-25 13:16:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:23,475 INFO L93 Difference]: Finished difference Result 897 states and 1547 transitions. [2018-07-25 13:16:23,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:23,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:16:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:23,479 INFO L225 Difference]: With dead ends: 897 [2018-07-25 13:16:23,479 INFO L226 Difference]: Without dead ends: 502 [2018-07-25 13:16:23,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-07-25 13:16:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435. [2018-07-25 13:16:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-07-25 13:16:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 751 transitions. [2018-07-25 13:16:23,690 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 751 transitions. Word has length 12 [2018-07-25 13:16:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:23,691 INFO L472 AbstractCegarLoop]: Abstraction has 435 states and 751 transitions. [2018-07-25 13:16:23,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 751 transitions. [2018-07-25 13:16:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:23,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:23,692 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:23,692 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-07-25 13:16:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:23,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:23,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:23,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:23,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:23,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:23,721 INFO L87 Difference]: Start difference. First operand 435 states and 751 transitions. Second operand 9 states. [2018-07-25 13:16:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:24,059 INFO L93 Difference]: Finished difference Result 481 states and 818 transitions. [2018-07-25 13:16:24,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:24,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:24,062 INFO L225 Difference]: With dead ends: 481 [2018-07-25 13:16:24,062 INFO L226 Difference]: Without dead ends: 479 [2018-07-25 13:16:24,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-25 13:16:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-07-25 13:16:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-07-25 13:16:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 764 transitions. [2018-07-25 13:16:24,297 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 764 transitions. Word has length 12 [2018-07-25 13:16:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:24,297 INFO L472 AbstractCegarLoop]: Abstraction has 444 states and 764 transitions. [2018-07-25 13:16:24,297 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 764 transitions. [2018-07-25 13:16:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:24,298 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:24,298 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:24,299 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-07-25 13:16:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:24,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:24,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:24,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:24,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:24,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:24,323 INFO L87 Difference]: Start difference. First operand 444 states and 764 transitions. Second operand 9 states. [2018-07-25 13:16:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:24,885 INFO L93 Difference]: Finished difference Result 515 states and 880 transitions. [2018-07-25 13:16:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:24,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:24,888 INFO L225 Difference]: With dead ends: 515 [2018-07-25 13:16:24,888 INFO L226 Difference]: Without dead ends: 513 [2018-07-25 13:16:24,889 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-07-25 13:16:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 468. [2018-07-25 13:16:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-07-25 13:16:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 808 transitions. [2018-07-25 13:16:25,148 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 808 transitions. Word has length 12 [2018-07-25 13:16:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:25,148 INFO L472 AbstractCegarLoop]: Abstraction has 468 states and 808 transitions. [2018-07-25 13:16:25,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 808 transitions. [2018-07-25 13:16:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:25,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:25,149 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:25,149 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -317442274, now seen corresponding path program 1 times [2018-07-25 13:16:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:25,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:25,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:25,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:25,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:25,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:25,175 INFO L87 Difference]: Start difference. First operand 468 states and 808 transitions. Second operand 9 states. [2018-07-25 13:16:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:25,664 INFO L93 Difference]: Finished difference Result 550 states and 930 transitions. [2018-07-25 13:16:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:25,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:25,667 INFO L225 Difference]: With dead ends: 550 [2018-07-25 13:16:25,667 INFO L226 Difference]: Without dead ends: 548 [2018-07-25 13:16:25,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:16:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-25 13:16:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 483. [2018-07-25 13:16:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-07-25 13:16:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 836 transitions. [2018-07-25 13:16:25,914 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 836 transitions. Word has length 13 [2018-07-25 13:16:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:25,914 INFO L472 AbstractCegarLoop]: Abstraction has 483 states and 836 transitions. [2018-07-25 13:16:25,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 836 transitions. [2018-07-25 13:16:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:25,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:25,915 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:25,916 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-07-25 13:16:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:25,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:25,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:25,933 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:25,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:25,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:25,934 INFO L87 Difference]: Start difference. First operand 483 states and 836 transitions. Second operand 8 states. [2018-07-25 13:16:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,296 INFO L93 Difference]: Finished difference Result 528 states and 903 transitions. [2018-07-25 13:16:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:26,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:16:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,299 INFO L225 Difference]: With dead ends: 528 [2018-07-25 13:16:26,299 INFO L226 Difference]: Without dead ends: 526 [2018-07-25 13:16:26,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-07-25 13:16:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 487. [2018-07-25 13:16:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 13:16:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-25 13:16:26,556 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-25 13:16:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:26,556 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-25 13:16:26,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-25 13:16:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:26,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:26,557 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:26,557 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-07-25 13:16:26,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:26,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:26,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:26,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:26,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:26,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:26,574 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-25 13:16:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,967 INFO L93 Difference]: Finished difference Result 562 states and 960 transitions. [2018-07-25 13:16:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:26,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:16:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,970 INFO L225 Difference]: With dead ends: 562 [2018-07-25 13:16:26,970 INFO L226 Difference]: Without dead ends: 560 [2018-07-25 13:16:26,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-07-25 13:16:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2018-07-25 13:16:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 13:16:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-25 13:16:27,234 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-25 13:16:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:27,234 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-25 13:16:27,235 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-25 13:16:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:27,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:27,236 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:27,236 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1602335980, now seen corresponding path program 3 times [2018-07-25 13:16:27,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:27,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:27,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:27,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:27,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:27,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:27,249 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-25 13:16:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:27,641 INFO L93 Difference]: Finished difference Result 554 states and 945 transitions. [2018-07-25 13:16:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:27,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:16:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:27,644 INFO L225 Difference]: With dead ends: 554 [2018-07-25 13:16:27,645 INFO L226 Difference]: Without dead ends: 552 [2018-07-25 13:16:27,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-07-25 13:16:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2018-07-25 13:16:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-07-25 13:16:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 832 transitions. [2018-07-25 13:16:27,920 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 832 transitions. Word has length 14 [2018-07-25 13:16:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:27,921 INFO L472 AbstractCegarLoop]: Abstraction has 481 states and 832 transitions. [2018-07-25 13:16:27,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 832 transitions. [2018-07-25 13:16:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:27,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:27,922 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:27,922 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:27,922 INFO L82 PathProgramCache]: Analyzing trace with hash -245567750, now seen corresponding path program 4 times [2018-07-25 13:16:27,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:27,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:27,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:27,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:27,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:27,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:27,935 INFO L87 Difference]: Start difference. First operand 481 states and 832 transitions. Second operand 8 states. [2018-07-25 13:16:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:28,358 INFO L93 Difference]: Finished difference Result 547 states and 937 transitions. [2018-07-25 13:16:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:28,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:16:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:28,362 INFO L225 Difference]: With dead ends: 547 [2018-07-25 13:16:28,362 INFO L226 Difference]: Without dead ends: 545 [2018-07-25 13:16:28,362 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-07-25 13:16:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488. [2018-07-25 13:16:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-07-25 13:16:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 844 transitions. [2018-07-25 13:16:28,641 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 844 transitions. Word has length 14 [2018-07-25 13:16:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:28,642 INFO L472 AbstractCegarLoop]: Abstraction has 488 states and 844 transitions. [2018-07-25 13:16:28,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 844 transitions. [2018-07-25 13:16:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:28,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:28,643 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:28,643 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-07-25 13:16:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:28,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:28,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:28,657 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:28,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:28,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:28,658 INFO L87 Difference]: Start difference. First operand 488 states and 844 transitions. Second operand 9 states. [2018-07-25 13:16:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,059 INFO L93 Difference]: Finished difference Result 545 states and 922 transitions. [2018-07-25 13:16:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:29,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-25 13:16:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,062 INFO L225 Difference]: With dead ends: 545 [2018-07-25 13:16:29,062 INFO L226 Difference]: Without dead ends: 543 [2018-07-25 13:16:29,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-25 13:16:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 473. [2018-07-25 13:16:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-25 13:16:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 820 transitions. [2018-07-25 13:16:29,347 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 820 transitions. Word has length 14 [2018-07-25 13:16:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:29,348 INFO L472 AbstractCegarLoop]: Abstraction has 473 states and 820 transitions. [2018-07-25 13:16:29,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 820 transitions. [2018-07-25 13:16:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:16:29,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:29,349 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:29,349 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-07-25 13:16:29,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:29,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:29,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:29,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:29,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:29,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:29,362 INFO L87 Difference]: Start difference. First operand 473 states and 820 transitions. Second operand 8 states. [2018-07-25 13:16:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,762 INFO L93 Difference]: Finished difference Result 535 states and 908 transitions. [2018-07-25 13:16:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:29,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:16:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,765 INFO L225 Difference]: With dead ends: 535 [2018-07-25 13:16:29,765 INFO L226 Difference]: Without dead ends: 533 [2018-07-25 13:16:29,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-07-25 13:16:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 469. [2018-07-25 13:16:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 13:16:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 814 transitions. [2018-07-25 13:16:30,013 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 814 transitions. Word has length 14 [2018-07-25 13:16:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:30,013 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 814 transitions. [2018-07-25 13:16:30,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 814 transitions. [2018-07-25 13:16:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:30,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:30,014 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:30,014 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times [2018-07-25 13:16:30,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:30,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:30,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:30,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:30,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:30,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:30,030 INFO L87 Difference]: Start difference. First operand 469 states and 814 transitions. Second operand 9 states. [2018-07-25 13:16:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:30,587 INFO L93 Difference]: Finished difference Result 1268 states and 2153 transitions. [2018-07-25 13:16:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:30,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 13:16:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:30,591 INFO L225 Difference]: With dead ends: 1268 [2018-07-25 13:16:30,591 INFO L226 Difference]: Without dead ends: 764 [2018-07-25 13:16:30,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-07-25 13:16:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651. [2018-07-25 13:16:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 13:16:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1121 transitions. [2018-07-25 13:16:30,911 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1121 transitions. Word has length 15 [2018-07-25 13:16:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:30,911 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1121 transitions. [2018-07-25 13:16:30,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1121 transitions. [2018-07-25 13:16:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:30,913 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:30,913 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:30,913 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 765271427, now seen corresponding path program 1 times [2018-07-25 13:16:30,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:30,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:30,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:30,928 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:30,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:30,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:30,929 INFO L87 Difference]: Start difference. First operand 651 states and 1121 transitions. Second operand 8 states. [2018-07-25 13:16:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:31,497 INFO L93 Difference]: Finished difference Result 1561 states and 2653 transitions. [2018-07-25 13:16:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:31,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-25 13:16:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:31,502 INFO L225 Difference]: With dead ends: 1561 [2018-07-25 13:16:31,502 INFO L226 Difference]: Without dead ends: 911 [2018-07-25 13:16:31,503 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-07-25 13:16:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 651. [2018-07-25 13:16:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 13:16:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1114 transitions. [2018-07-25 13:16:31,895 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1114 transitions. Word has length 15 [2018-07-25 13:16:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:31,895 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1114 transitions. [2018-07-25 13:16:31,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1114 transitions. [2018-07-25 13:16:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:31,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:31,897 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:31,897 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times [2018-07-25 13:16:31,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:31,918 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:31,918 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:31,918 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:31,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:31,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:31,919 INFO L87 Difference]: Start difference. First operand 651 states and 1114 transitions. Second operand 10 states. [2018-07-25 13:16:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:32,458 INFO L93 Difference]: Finished difference Result 756 states and 1259 transitions. [2018-07-25 13:16:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:32,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:32,462 INFO L225 Difference]: With dead ends: 756 [2018-07-25 13:16:32,462 INFO L226 Difference]: Without dead ends: 754 [2018-07-25 13:16:32,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-07-25 13:16:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 687. [2018-07-25 13:16:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-07-25 13:16:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1172 transitions. [2018-07-25 13:16:32,766 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1172 transitions. Word has length 15 [2018-07-25 13:16:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:32,766 INFO L472 AbstractCegarLoop]: Abstraction has 687 states and 1172 transitions. [2018-07-25 13:16:32,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1172 transitions. [2018-07-25 13:16:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:32,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:32,768 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:32,768 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-07-25 13:16:32,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:32,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:32,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:32,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:32,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:32,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:32,785 INFO L87 Difference]: Start difference. First operand 687 states and 1172 transitions. Second operand 10 states. [2018-07-25 13:16:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:33,355 INFO L93 Difference]: Finished difference Result 826 states and 1381 transitions. [2018-07-25 13:16:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:33,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:33,361 INFO L225 Difference]: With dead ends: 826 [2018-07-25 13:16:33,361 INFO L226 Difference]: Without dead ends: 824 [2018-07-25 13:16:33,362 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-07-25 13:16:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 720. [2018-07-25 13:16:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-07-25 13:16:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1226 transitions. [2018-07-25 13:16:33,648 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1226 transitions. Word has length 15 [2018-07-25 13:16:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:33,649 INFO L472 AbstractCegarLoop]: Abstraction has 720 states and 1226 transitions. [2018-07-25 13:16:33,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1226 transitions. [2018-07-25 13:16:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:33,650 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:33,650 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:33,651 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times [2018-07-25 13:16:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:33,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:33,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:33,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:33,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:33,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:33,667 INFO L87 Difference]: Start difference. First operand 720 states and 1226 transitions. Second operand 10 states. [2018-07-25 13:16:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:34,315 INFO L93 Difference]: Finished difference Result 843 states and 1413 transitions. [2018-07-25 13:16:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:34,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:34,320 INFO L225 Difference]: With dead ends: 843 [2018-07-25 13:16:34,321 INFO L226 Difference]: Without dead ends: 841 [2018-07-25 13:16:34,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-07-25 13:16:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 770. [2018-07-25 13:16:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-07-25 13:16:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1300 transitions. [2018-07-25 13:16:34,606 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1300 transitions. Word has length 15 [2018-07-25 13:16:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:34,607 INFO L472 AbstractCegarLoop]: Abstraction has 770 states and 1300 transitions. [2018-07-25 13:16:34,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1300 transitions. [2018-07-25 13:16:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:34,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:34,608 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:34,608 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-07-25 13:16:34,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:34,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:34,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:34,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:34,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:34,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:34,623 INFO L87 Difference]: Start difference. First operand 770 states and 1300 transitions. Second operand 10 states. [2018-07-25 13:16:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:35,262 INFO L93 Difference]: Finished difference Result 960 states and 1623 transitions. [2018-07-25 13:16:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:35,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:35,267 INFO L225 Difference]: With dead ends: 960 [2018-07-25 13:16:35,267 INFO L226 Difference]: Without dead ends: 958 [2018-07-25 13:16:35,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-07-25 13:16:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 837. [2018-07-25 13:16:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-07-25 13:16:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1422 transitions. [2018-07-25 13:16:35,590 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1422 transitions. Word has length 15 [2018-07-25 13:16:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:35,590 INFO L472 AbstractCegarLoop]: Abstraction has 837 states and 1422 transitions. [2018-07-25 13:16:35,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1422 transitions. [2018-07-25 13:16:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:35,592 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:35,592 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:35,592 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times [2018-07-25 13:16:35,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:35,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:35,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:35,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:35,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:35,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:35,606 INFO L87 Difference]: Start difference. First operand 837 states and 1422 transitions. Second operand 10 states. [2018-07-25 13:16:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:36,505 INFO L93 Difference]: Finished difference Result 1027 states and 1720 transitions. [2018-07-25 13:16:36,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:36,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:36,511 INFO L225 Difference]: With dead ends: 1027 [2018-07-25 13:16:36,512 INFO L226 Difference]: Without dead ends: 1025 [2018-07-25 13:16:36,513 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:16:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-07-25 13:16:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 849. [2018-07-25 13:16:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-07-25 13:16:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1445 transitions. [2018-07-25 13:16:37,082 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1445 transitions. Word has length 15 [2018-07-25 13:16:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:37,082 INFO L472 AbstractCegarLoop]: Abstraction has 849 states and 1445 transitions. [2018-07-25 13:16:37,082 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1445 transitions. [2018-07-25 13:16:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:37,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:37,084 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:37,084 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-07-25 13:16:37,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:37,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:37,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:37,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:37,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:37,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:37,100 INFO L87 Difference]: Start difference. First operand 849 states and 1445 transitions. Second operand 10 states. [2018-07-25 13:16:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:37,873 INFO L93 Difference]: Finished difference Result 1032 states and 1733 transitions. [2018-07-25 13:16:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:37,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:37,879 INFO L225 Difference]: With dead ends: 1032 [2018-07-25 13:16:37,879 INFO L226 Difference]: Without dead ends: 1030 [2018-07-25 13:16:37,879 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-07-25 13:16:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 869. [2018-07-25 13:16:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-25 13:16:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1477 transitions. [2018-07-25 13:16:38,209 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1477 transitions. Word has length 15 [2018-07-25 13:16:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:38,209 INFO L472 AbstractCegarLoop]: Abstraction has 869 states and 1477 transitions. [2018-07-25 13:16:38,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1477 transitions. [2018-07-25 13:16:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:38,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:38,211 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:38,211 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:38,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times [2018-07-25 13:16:38,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:38,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:38,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:38,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:38,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:38,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:38,224 INFO L87 Difference]: Start difference. First operand 869 states and 1477 transitions. Second operand 10 states. [2018-07-25 13:16:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:38,674 INFO L93 Difference]: Finished difference Result 945 states and 1593 transitions. [2018-07-25 13:16:38,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:38,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:38,679 INFO L225 Difference]: With dead ends: 945 [2018-07-25 13:16:38,679 INFO L226 Difference]: Without dead ends: 943 [2018-07-25 13:16:38,679 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-07-25 13:16:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869. [2018-07-25 13:16:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-25 13:16:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1474 transitions. [2018-07-25 13:16:38,994 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1474 transitions. Word has length 15 [2018-07-25 13:16:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:38,994 INFO L472 AbstractCegarLoop]: Abstraction has 869 states and 1474 transitions. [2018-07-25 13:16:38,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1474 transitions. [2018-07-25 13:16:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:38,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:38,995 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:38,995 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2018-07-25 13:16:38,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:39,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:39,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:39,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:39,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:39,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:39,008 INFO L87 Difference]: Start difference. First operand 869 states and 1474 transitions. Second operand 10 states. [2018-07-25 13:16:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:39,444 INFO L93 Difference]: Finished difference Result 978 states and 1648 transitions. [2018-07-25 13:16:39,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:39,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:39,449 INFO L225 Difference]: With dead ends: 978 [2018-07-25 13:16:39,449 INFO L226 Difference]: Without dead ends: 976 [2018-07-25 13:16:39,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-07-25 13:16:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871. [2018-07-25 13:16:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-07-25 13:16:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1477 transitions. [2018-07-25 13:16:39,792 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1477 transitions. Word has length 15 [2018-07-25 13:16:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:39,792 INFO L472 AbstractCegarLoop]: Abstraction has 871 states and 1477 transitions. [2018-07-25 13:16:39,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1477 transitions. [2018-07-25 13:16:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:39,793 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:39,793 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:39,794 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times [2018-07-25 13:16:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:39,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:39,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:39,805 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:39,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:39,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:39,806 INFO L87 Difference]: Start difference. First operand 871 states and 1477 transitions. Second operand 10 states. [2018-07-25 13:16:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:40,299 INFO L93 Difference]: Finished difference Result 1018 states and 1716 transitions. [2018-07-25 13:16:40,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:40,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:40,304 INFO L225 Difference]: With dead ends: 1018 [2018-07-25 13:16:40,304 INFO L226 Difference]: Without dead ends: 1016 [2018-07-25 13:16:40,304 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-07-25 13:16:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931. [2018-07-25 13:16:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-07-25 13:16:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1584 transitions. [2018-07-25 13:16:40,690 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1584 transitions. Word has length 15 [2018-07-25 13:16:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:40,691 INFO L472 AbstractCegarLoop]: Abstraction has 931 states and 1584 transitions. [2018-07-25 13:16:40,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1584 transitions. [2018-07-25 13:16:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:40,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:40,692 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:40,693 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times [2018-07-25 13:16:40,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:40,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:40,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:40,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:40,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:40,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:40,705 INFO L87 Difference]: Start difference. First operand 931 states and 1584 transitions. Second operand 10 states. [2018-07-25 13:16:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:41,238 INFO L93 Difference]: Finished difference Result 1157 states and 1937 transitions. [2018-07-25 13:16:41,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:41,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:41,241 INFO L225 Difference]: With dead ends: 1157 [2018-07-25 13:16:41,241 INFO L226 Difference]: Without dead ends: 1155 [2018-07-25 13:16:41,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-07-25 13:16:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 976. [2018-07-25 13:16:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-07-25 13:16:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1662 transitions. [2018-07-25 13:16:41,616 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1662 transitions. Word has length 15 [2018-07-25 13:16:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:41,616 INFO L472 AbstractCegarLoop]: Abstraction has 976 states and 1662 transitions. [2018-07-25 13:16:41,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1662 transitions. [2018-07-25 13:16:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:41,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:41,618 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:41,618 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times [2018-07-25 13:16:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:41,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:41,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:41,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:41,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:41,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:41,629 INFO L87 Difference]: Start difference. First operand 976 states and 1662 transitions. Second operand 10 states. [2018-07-25 13:16:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:42,382 INFO L93 Difference]: Finished difference Result 1198 states and 2004 transitions. [2018-07-25 13:16:42,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:42,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:42,384 INFO L225 Difference]: With dead ends: 1198 [2018-07-25 13:16:42,384 INFO L226 Difference]: Without dead ends: 1196 [2018-07-25 13:16:42,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-07-25 13:16:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 998. [2018-07-25 13:16:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-07-25 13:16:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1695 transitions. [2018-07-25 13:16:42,757 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1695 transitions. Word has length 15 [2018-07-25 13:16:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,757 INFO L472 AbstractCegarLoop]: Abstraction has 998 states and 1695 transitions. [2018-07-25 13:16:42,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1695 transitions. [2018-07-25 13:16:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:42,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,758 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:42,758 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times [2018-07-25 13:16:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:42,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:42,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:42,769 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:42,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:42,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:42,770 INFO L87 Difference]: Start difference. First operand 998 states and 1695 transitions. Second operand 10 states. [2018-07-25 13:16:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,341 INFO L93 Difference]: Finished difference Result 1161 states and 1935 transitions. [2018-07-25 13:16:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:43,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,343 INFO L225 Difference]: With dead ends: 1161 [2018-07-25 13:16:43,343 INFO L226 Difference]: Without dead ends: 1159 [2018-07-25 13:16:43,344 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-07-25 13:16:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1022. [2018-07-25 13:16:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-07-25 13:16:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1728 transitions. [2018-07-25 13:16:43,731 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1728 transitions. Word has length 15 [2018-07-25 13:16:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,731 INFO L472 AbstractCegarLoop]: Abstraction has 1022 states and 1728 transitions. [2018-07-25 13:16:43,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1728 transitions. [2018-07-25 13:16:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:43,733 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,733 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:43,733 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 415120859, now seen corresponding path program 1 times [2018-07-25 13:16:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:43,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:43,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:43,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:43,752 INFO L87 Difference]: Start difference. First operand 1022 states and 1728 transitions. Second operand 10 states. [2018-07-25 13:16:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,398 INFO L93 Difference]: Finished difference Result 1173 states and 1946 transitions. [2018-07-25 13:16:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:44,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-07-25 13:16:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,400 INFO L225 Difference]: With dead ends: 1173 [2018-07-25 13:16:44,400 INFO L226 Difference]: Without dead ends: 1171 [2018-07-25 13:16:44,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-07-25 13:16:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1065. [2018-07-25 13:16:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-07-25 13:16:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1806 transitions. [2018-07-25 13:16:44,837 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1806 transitions. Word has length 16 [2018-07-25 13:16:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,837 INFO L472 AbstractCegarLoop]: Abstraction has 1065 states and 1806 transitions. [2018-07-25 13:16:44,837 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1806 transitions. [2018-07-25 13:16:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:44,838 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,838 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:44,838 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1829543949, now seen corresponding path program 1 times [2018-07-25 13:16:44,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:44,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:44,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:44,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:44,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:44,846 INFO L87 Difference]: Start difference. First operand 1065 states and 1806 transitions. Second operand 7 states. [2018-07-25 13:16:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,543 INFO L93 Difference]: Finished difference Result 2706 states and 4565 transitions. [2018-07-25 13:16:45,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:45,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 13:16:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,546 INFO L225 Difference]: With dead ends: 2706 [2018-07-25 13:16:45,546 INFO L226 Difference]: Without dead ends: 1625 [2018-07-25 13:16:45,548 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-07-25 13:16:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1258. [2018-07-25 13:16:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-07-25 13:16:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2139 transitions. [2018-07-25 13:16:46,042 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 2139 transitions. Word has length 16 [2018-07-25 13:16:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,042 INFO L472 AbstractCegarLoop]: Abstraction has 1258 states and 2139 transitions. [2018-07-25 13:16:46,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2139 transitions. [2018-07-25 13:16:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:46,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,044 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:46,044 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1269790439, now seen corresponding path program 1 times [2018-07-25 13:16:46,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:46,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:46,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:46,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:46,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:46,054 INFO L87 Difference]: Start difference. First operand 1258 states and 2139 transitions. Second operand 7 states. [2018-07-25 13:16:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,908 INFO L93 Difference]: Finished difference Result 3012 states and 5088 transitions. [2018-07-25 13:16:46,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:46,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 13:16:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,912 INFO L225 Difference]: With dead ends: 3012 [2018-07-25 13:16:46,912 INFO L226 Difference]: Without dead ends: 1713 [2018-07-25 13:16:46,914 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-07-25 13:16:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521. [2018-07-25 13:16:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-07-25 13:16:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2545 transitions. [2018-07-25 13:16:47,699 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2545 transitions. Word has length 16 [2018-07-25 13:16:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,699 INFO L472 AbstractCegarLoop]: Abstraction has 1521 states and 2545 transitions. [2018-07-25 13:16:47,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2545 transitions. [2018-07-25 13:16:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:47,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,700 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:47,700 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash 323600233, now seen corresponding path program 2 times [2018-07-25 13:16:47,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:47,707 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,707 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:47,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:47,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:47,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:47,708 INFO L87 Difference]: Start difference. First operand 1521 states and 2545 transitions. Second operand 7 states. [2018-07-25 13:16:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,628 INFO L93 Difference]: Finished difference Result 3615 states and 5961 transitions. [2018-07-25 13:16:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:48,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 13:16:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,633 INFO L225 Difference]: With dead ends: 3615 [2018-07-25 13:16:48,633 INFO L226 Difference]: Without dead ends: 2069 [2018-07-25 13:16:48,636 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-25 13:16:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1724. [2018-07-25 13:16:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-07-25 13:16:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2809 transitions. [2018-07-25 13:16:49,406 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2809 transitions. Word has length 16 [2018-07-25 13:16:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,407 INFO L472 AbstractCegarLoop]: Abstraction has 1724 states and 2809 transitions. [2018-07-25 13:16:49,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2809 transitions. [2018-07-25 13:16:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:49,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,409 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:49,409 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1273855967, now seen corresponding path program 2 times [2018-07-25 13:16:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:49,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:49,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:49,427 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:49,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:49,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:49,428 INFO L87 Difference]: Start difference. First operand 1724 states and 2809 transitions. Second operand 11 states. [2018-07-25 13:16:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,496 INFO L93 Difference]: Finished difference Result 1829 states and 2955 transitions. [2018-07-25 13:16:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:16:50,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-25 13:16:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,500 INFO L225 Difference]: With dead ends: 1829 [2018-07-25 13:16:50,501 INFO L226 Difference]: Without dead ends: 1820 [2018-07-25 13:16:50,501 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:16:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-07-25 13:16:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1714. [2018-07-25 13:16:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-07-25 13:16:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2793 transitions. [2018-07-25 13:16:51,278 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2793 transitions. Word has length 17 [2018-07-25 13:16:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:51,278 INFO L472 AbstractCegarLoop]: Abstraction has 1714 states and 2793 transitions. [2018-07-25 13:16:51,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2793 transitions. [2018-07-25 13:16:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:51,280 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:51,280 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:51,280 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-07-25 13:16:51,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:51,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:51,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:51,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:51,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:51,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:51,310 INFO L87 Difference]: Start difference. First operand 1714 states and 2793 transitions. Second operand 12 states. [2018-07-25 13:16:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,153 INFO L93 Difference]: Finished difference Result 1784 states and 2895 transitions. [2018-07-25 13:16:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:52,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,157 INFO L225 Difference]: With dead ends: 1784 [2018-07-25 13:16:52,157 INFO L226 Difference]: Without dead ends: 1783 [2018-07-25 13:16:52,158 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-07-25 13:16:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1719. [2018-07-25 13:16:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-07-25 13:16:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2802 transitions. [2018-07-25 13:16:52,959 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2802 transitions. Word has length 18 [2018-07-25 13:16:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,959 INFO L472 AbstractCegarLoop]: Abstraction has 1719 states and 2802 transitions. [2018-07-25 13:16:52,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2802 transitions. [2018-07-25 13:16:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:52,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,961 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:52,961 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-07-25 13:16:52,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:52,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:52,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:52,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:52,990 INFO L87 Difference]: Start difference. First operand 1719 states and 2802 transitions. Second operand 12 states. [2018-07-25 13:16:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,137 INFO L93 Difference]: Finished difference Result 1783 states and 2889 transitions. [2018-07-25 13:16:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:54,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,139 INFO L225 Difference]: With dead ends: 1783 [2018-07-25 13:16:54,139 INFO L226 Difference]: Without dead ends: 1781 [2018-07-25 13:16:54,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-07-25 13:16:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1723. [2018-07-25 13:16:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-25 13:16:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-25 13:16:54,994 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 18 [2018-07-25 13:16:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,994 INFO L472 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-25 13:16:54,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-25 13:16:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:54,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,996 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:54,996 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1629794958, now seen corresponding path program 2 times [2018-07-25 13:16:54,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:55,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,022 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:55,022 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:55,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:55,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:55,023 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 12 states. [2018-07-25 13:16:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:56,101 INFO L93 Difference]: Finished difference Result 2036 states and 3314 transitions. [2018-07-25 13:16:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:56,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:56,104 INFO L225 Difference]: With dead ends: 2036 [2018-07-25 13:16:56,104 INFO L226 Difference]: Without dead ends: 2035 [2018-07-25 13:16:56,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2018-07-25 13:16:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1858. [2018-07-25 13:16:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-07-25 13:16:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3040 transitions. [2018-07-25 13:16:56,981 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3040 transitions. Word has length 18 [2018-07-25 13:16:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,981 INFO L472 AbstractCegarLoop]: Abstraction has 1858 states and 3040 transitions. [2018-07-25 13:16:56,981 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3040 transitions. [2018-07-25 13:16:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:56,982 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,982 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:56,983 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash -446449989, now seen corresponding path program 1 times [2018-07-25 13:16:56,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:56,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:57,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:57,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:57,000 INFO L87 Difference]: Start difference. First operand 1858 states and 3040 transitions. Second operand 11 states. [2018-07-25 13:16:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,986 INFO L93 Difference]: Finished difference Result 2046 states and 3338 transitions. [2018-07-25 13:16:57,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:16:57,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,989 INFO L225 Difference]: With dead ends: 2046 [2018-07-25 13:16:57,989 INFO L226 Difference]: Without dead ends: 2044 [2018-07-25 13:16:57,990 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-07-25 13:16:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1922. [2018-07-25 13:16:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-07-25 13:16:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3155 transitions. [2018-07-25 13:16:58,838 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3155 transitions. Word has length 18 [2018-07-25 13:16:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,838 INFO L472 AbstractCegarLoop]: Abstraction has 1922 states and 3155 transitions. [2018-07-25 13:16:58,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3155 transitions. [2018-07-25 13:16:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:58,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,840 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:58,841 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-07-25 13:16:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:58,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:58,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:58,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:58,857 INFO L87 Difference]: Start difference. First operand 1922 states and 3155 transitions. Second operand 11 states. [2018-07-25 13:17:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:00,167 INFO L93 Difference]: Finished difference Result 2251 states and 3688 transitions. [2018-07-25 13:17:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:00,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:00,169 INFO L225 Difference]: With dead ends: 2251 [2018-07-25 13:17:00,169 INFO L226 Difference]: Without dead ends: 2249 [2018-07-25 13:17:00,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:17:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-07-25 13:17:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2029. [2018-07-25 13:17:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 13:17:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3346 transitions. [2018-07-25 13:17:00,997 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3346 transitions. Word has length 18 [2018-07-25 13:17:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,997 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3346 transitions. [2018-07-25 13:17:00,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3346 transitions. [2018-07-25 13:17:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:00,998 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,999 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:00,999 INFO L415 AbstractCegarLoop]: === Iteration 69 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310343, now seen corresponding path program 3 times [2018-07-25 13:17:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:01,015 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:01,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:01,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:01,016 INFO L87 Difference]: Start difference. First operand 2029 states and 3346 transitions. Second operand 13 states. [2018-07-25 13:17:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:01,952 INFO L93 Difference]: Finished difference Result 2101 states and 3451 transitions. [2018-07-25 13:17:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:17:01,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 13:17:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:01,955 INFO L225 Difference]: With dead ends: 2101 [2018-07-25 13:17:01,955 INFO L226 Difference]: Without dead ends: 2100 [2018-07-25 13:17:01,956 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:17:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-07-25 13:17:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2029. [2018-07-25 13:17:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 13:17:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3343 transitions. [2018-07-25 13:17:02,794 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3343 transitions. Word has length 18 [2018-07-25 13:17:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,794 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3343 transitions. [2018-07-25 13:17:02,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3343 transitions. [2018-07-25 13:17:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:02,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,795 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:02,795 INFO L415 AbstractCegarLoop]: === Iteration 70 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1235464429, now seen corresponding path program 2 times [2018-07-25 13:17:02,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:02,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:02,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:02,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:02,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:02,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:02,810 INFO L87 Difference]: Start difference. First operand 2029 states and 3343 transitions. Second operand 11 states. [2018-07-25 13:17:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:03,953 INFO L93 Difference]: Finished difference Result 2256 states and 3702 transitions. [2018-07-25 13:17:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:17:03,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:03,956 INFO L225 Difference]: With dead ends: 2256 [2018-07-25 13:17:03,956 INFO L226 Difference]: Without dead ends: 2254 [2018-07-25 13:17:03,956 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:17:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2018-07-25 13:17:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2040. [2018-07-25 13:17:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-07-25 13:17:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3369 transitions. [2018-07-25 13:17:04,793 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3369 transitions. Word has length 18 [2018-07-25 13:17:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:04,793 INFO L472 AbstractCegarLoop]: Abstraction has 2040 states and 3369 transitions. [2018-07-25 13:17:04,793 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3369 transitions. [2018-07-25 13:17:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:04,794 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:04,794 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:17:04,794 INFO L415 AbstractCegarLoop]: === Iteration 71 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash -111984382, now seen corresponding path program 4 times [2018-07-25 13:17:04,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:17:04,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:04,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:04,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:04,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:04,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:04,811 INFO L87 Difference]: Start difference. First operand 2040 states and 3369 transitions. Second operand 12 states. [2018-07-25 13:17:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,931 INFO L93 Difference]: Finished difference Result 2243 states and 3672 transitions. [2018-07-25 13:17:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:17:05,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:17:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,935 INFO L225 Difference]: With dead ends: 2243 [2018-07-25 13:17:05,935 INFO L226 Difference]: Without dead ends: 2242 [2018-07-25 13:17:05,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:17:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2018-07-25 13:17:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2029. [2018-07-25 13:17:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 13:17:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3348 transitions. [2018-07-25 13:17:06,883 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3348 transitions. Word has length 18 [2018-07-25 13:17:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:06,883 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3348 transitions. [2018-07-25 13:17:06,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3348 transitions. [2018-07-25 13:17:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:06,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:06,885 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:06,885 INFO L415 AbstractCegarLoop]: === Iteration 72 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -111983100, now seen corresponding path program 1 times [2018-07-25 13:17:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:06,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:06,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:06,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:06,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:06,897 INFO L87 Difference]: Start difference. First operand 2029 states and 3348 transitions. Second operand 11 states. [2018-07-25 13:17:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:08,067 INFO L93 Difference]: Finished difference Result 2267 states and 3717 transitions. [2018-07-25 13:17:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:17:08,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:08,070 INFO L225 Difference]: With dead ends: 2267 [2018-07-25 13:17:08,070 INFO L226 Difference]: Without dead ends: 2265 [2018-07-25 13:17:08,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:17:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2018-07-25 13:17:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063. [2018-07-25 13:17:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-07-25 13:17:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3413 transitions. [2018-07-25 13:17:08,935 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3413 transitions. Word has length 18 [2018-07-25 13:17:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,936 INFO L472 AbstractCegarLoop]: Abstraction has 2063 states and 3413 transitions. [2018-07-25 13:17:08,936 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3413 transitions. [2018-07-25 13:17:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:08,938 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,938 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:08,938 INFO L415 AbstractCegarLoop]: === Iteration 73 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash -103396213, now seen corresponding path program 2 times [2018-07-25 13:17:08,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:08,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:08,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:08,953 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:08,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:08,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:08,953 INFO L87 Difference]: Start difference. First operand 2063 states and 3413 transitions. Second operand 11 states. [2018-07-25 13:17:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:10,109 INFO L93 Difference]: Finished difference Result 2234 states and 3657 transitions. [2018-07-25 13:17:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:17:10,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:10,111 INFO L225 Difference]: With dead ends: 2234 [2018-07-25 13:17:10,111 INFO L226 Difference]: Without dead ends: 2232 [2018-07-25 13:17:10,111 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:17:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-07-25 13:17:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2062. [2018-07-25 13:17:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-25 13:17:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3410 transitions. [2018-07-25 13:17:10,977 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3410 transitions. Word has length 18 [2018-07-25 13:17:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:10,977 INFO L472 AbstractCegarLoop]: Abstraction has 2062 states and 3410 transitions. [2018-07-25 13:17:10,977 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3410 transitions. [2018-07-25 13:17:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:10,978 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:10,978 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:10,979 INFO L415 AbstractCegarLoop]: === Iteration 74 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -103395925, now seen corresponding path program 5 times [2018-07-25 13:17:10,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:10,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:10,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:10,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:10,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:10,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:10,999 INFO L87 Difference]: Start difference. First operand 2062 states and 3410 transitions. Second operand 13 states. [2018-07-25 13:17:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:12,130 INFO L93 Difference]: Finished difference Result 2220 states and 3648 transitions. [2018-07-25 13:17:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:17:12,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 13:17:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:12,133 INFO L225 Difference]: With dead ends: 2220 [2018-07-25 13:17:12,134 INFO L226 Difference]: Without dead ends: 2219 [2018-07-25 13:17:12,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:17:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-07-25 13:17:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2062. [2018-07-25 13:17:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-25 13:17:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3406 transitions. [2018-07-25 13:17:13,014 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3406 transitions. Word has length 18 [2018-07-25 13:17:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:13,014 INFO L472 AbstractCegarLoop]: Abstraction has 2062 states and 3406 transitions. [2018-07-25 13:17:13,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3406 transitions. [2018-07-25 13:17:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:13,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:13,016 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:13,016 INFO L415 AbstractCegarLoop]: === Iteration 75 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-07-25 13:17:13,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:13,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:13,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:13,030 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:13,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:13,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:13,030 INFO L87 Difference]: Start difference. First operand 2062 states and 3406 transitions. Second operand 11 states. [2018-07-25 13:17:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:14,321 INFO L93 Difference]: Finished difference Result 2348 states and 3848 transitions. [2018-07-25 13:17:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:17:14,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:14,323 INFO L225 Difference]: With dead ends: 2348 [2018-07-25 13:17:14,323 INFO L226 Difference]: Without dead ends: 2346 [2018-07-25 13:17:14,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:17:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-07-25 13:17:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2069. [2018-07-25 13:17:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2018-07-25 13:17:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3421 transitions. [2018-07-25 13:17:15,194 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3421 transitions. Word has length 18 [2018-07-25 13:17:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:15,195 INFO L472 AbstractCegarLoop]: Abstraction has 2069 states and 3421 transitions. [2018-07-25 13:17:15,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3421 transitions. [2018-07-25 13:17:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:15,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:15,196 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:15,196 INFO L415 AbstractCegarLoop]: === Iteration 76 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 3 times [2018-07-25 13:17:15,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:15,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:15,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:15,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:15,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:15,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:15,207 INFO L87 Difference]: Start difference. First operand 2069 states and 3421 transitions. Second operand 11 states. [2018-07-25 13:17:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,415 INFO L93 Difference]: Finished difference Result 2308 states and 3773 transitions. [2018-07-25 13:17:16,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:17:16,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,417 INFO L225 Difference]: With dead ends: 2308 [2018-07-25 13:17:16,417 INFO L226 Difference]: Without dead ends: 2306 [2018-07-25 13:17:16,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:17:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-07-25 13:17:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2060. [2018-07-25 13:17:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2018-07-25 13:17:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3397 transitions. [2018-07-25 13:17:17,304 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3397 transitions. Word has length 18 [2018-07-25 13:17:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:17,304 INFO L472 AbstractCegarLoop]: Abstraction has 2060 states and 3397 transitions. [2018-07-25 13:17:17,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3397 transitions. [2018-07-25 13:17:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:17,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:17,305 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:17,305 INFO L415 AbstractCegarLoop]: === Iteration 77 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170099, now seen corresponding path program 6 times [2018-07-25 13:17:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:17,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:17,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:17,319 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:17,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:17,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:17,320 INFO L87 Difference]: Start difference. First operand 2060 states and 3397 transitions. Second operand 13 states. [2018-07-25 13:17:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:18,634 INFO L93 Difference]: Finished difference Result 2308 states and 3783 transitions. [2018-07-25 13:17:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:17:18,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 13:17:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:18,636 INFO L225 Difference]: With dead ends: 2308 [2018-07-25 13:17:18,636 INFO L226 Difference]: Without dead ends: 2307 [2018-07-25 13:17:18,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:17:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-07-25 13:17:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2057. [2018-07-25 13:17:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-07-25 13:17:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3387 transitions. [2018-07-25 13:17:19,542 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3387 transitions. Word has length 18 [2018-07-25 13:17:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:19,542 INFO L472 AbstractCegarLoop]: Abstraction has 2057 states and 3387 transitions. [2018-07-25 13:17:19,542 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3387 transitions. [2018-07-25 13:17:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:19,543 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:19,544 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:19,544 INFO L415 AbstractCegarLoop]: === Iteration 78 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1198893179, now seen corresponding path program 4 times [2018-07-25 13:17:19,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:19,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:19,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:19,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:19,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:19,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:19,554 INFO L87 Difference]: Start difference. First operand 2057 states and 3387 transitions. Second operand 11 states. [2018-07-25 13:17:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:20,853 INFO L93 Difference]: Finished difference Result 2380 states and 3900 transitions. [2018-07-25 13:17:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:20,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:20,856 INFO L225 Difference]: With dead ends: 2380 [2018-07-25 13:17:20,856 INFO L226 Difference]: Without dead ends: 2378 [2018-07-25 13:17:20,857 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:17:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2018-07-25 13:17:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2049. [2018-07-25 13:17:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-07-25 13:17:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3368 transitions. [2018-07-25 13:17:21,851 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3368 transitions. Word has length 18 [2018-07-25 13:17:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,851 INFO L472 AbstractCegarLoop]: Abstraction has 2049 states and 3368 transitions. [2018-07-25 13:17:21,851 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3368 transitions. [2018-07-25 13:17:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:21,852 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,852 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:21,852 INFO L415 AbstractCegarLoop]: === Iteration 79 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1428793719, now seen corresponding path program 1 times [2018-07-25 13:17:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:21,868 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:21,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:21,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:21,868 INFO L87 Difference]: Start difference. First operand 2049 states and 3368 transitions. Second operand 11 states. [2018-07-25 13:17:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:22,922 INFO L93 Difference]: Finished difference Result 2143 states and 3512 transitions. [2018-07-25 13:17:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:22,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:22,924 INFO L225 Difference]: With dead ends: 2143 [2018-07-25 13:17:22,924 INFO L226 Difference]: Without dead ends: 2141 [2018-07-25 13:17:22,925 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:17:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2018-07-25 13:17:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2055. [2018-07-25 13:17:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-07-25 13:17:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3378 transitions. [2018-07-25 13:17:23,834 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3378 transitions. Word has length 18 [2018-07-25 13:17:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:23,834 INFO L472 AbstractCegarLoop]: Abstraction has 2055 states and 3378 transitions. [2018-07-25 13:17:23,834 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3378 transitions. [2018-07-25 13:17:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:17:23,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:23,836 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:23,836 INFO L415 AbstractCegarLoop]: === Iteration 80 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 383805696, now seen corresponding path program 1 times [2018-07-25 13:17:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:23,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:23,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:23,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:23,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:23,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:23,853 INFO L87 Difference]: Start difference. First operand 2055 states and 3378 transitions. Second operand 11 states. [2018-07-25 13:17:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:25,004 INFO L93 Difference]: Finished difference Result 2243 states and 3674 transitions. [2018-07-25 13:17:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:17:25,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:17:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:25,006 INFO L225 Difference]: With dead ends: 2243 [2018-07-25 13:17:25,006 INFO L226 Difference]: Without dead ends: 2241 [2018-07-25 13:17:25,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:17:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-07-25 13:17:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-07-25 13:17:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-07-25 13:17:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3406 transitions. [2018-07-25 13:17:25,980 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3406 transitions. Word has length 18 [2018-07-25 13:17:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:25,980 INFO L472 AbstractCegarLoop]: Abstraction has 2072 states and 3406 transitions. [2018-07-25 13:17:25,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3406 transitions. [2018-07-25 13:17:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:25,982 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:25,982 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:25,982 INFO L415 AbstractCegarLoop]: === Iteration 81 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:25,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-07-25 13:17:25,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:26,008 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:26,009 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:26,009 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:26,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:26,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:26,009 INFO L87 Difference]: Start difference. First operand 2072 states and 3406 transitions. Second operand 13 states. [2018-07-25 13:17:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:27,198 INFO L93 Difference]: Finished difference Result 2153 states and 3525 transitions. [2018-07-25 13:17:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:17:27,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:17:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:27,201 INFO L225 Difference]: With dead ends: 2153 [2018-07-25 13:17:27,201 INFO L226 Difference]: Without dead ends: 2152 [2018-07-25 13:17:27,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:17:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-07-25 13:17:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2082. [2018-07-25 13:17:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-07-25 13:17:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3423 transitions. [2018-07-25 13:17:28,140 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3423 transitions. Word has length 19 [2018-07-25 13:17:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:28,140 INFO L472 AbstractCegarLoop]: Abstraction has 2082 states and 3423 transitions. [2018-07-25 13:17:28,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3423 transitions. [2018-07-25 13:17:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:28,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:28,143 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:28,143 INFO L415 AbstractCegarLoop]: === Iteration 82 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758835, now seen corresponding path program 1 times [2018-07-25 13:17:28,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:28,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:28,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:28,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:28,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:28,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:28,162 INFO L87 Difference]: Start difference. First operand 2082 states and 3423 transitions. Second operand 13 states. [2018-07-25 13:17:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:29,389 INFO L93 Difference]: Finished difference Result 2189 states and 3589 transitions. [2018-07-25 13:17:29,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:17:29,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:17:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:29,392 INFO L225 Difference]: With dead ends: 2189 [2018-07-25 13:17:29,392 INFO L226 Difference]: Without dead ends: 2187 [2018-07-25 13:17:29,393 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:17:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-07-25 13:17:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2100. [2018-07-25 13:17:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-07-25 13:17:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3458 transitions. [2018-07-25 13:17:30,437 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3458 transitions. Word has length 19 [2018-07-25 13:17:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:30,438 INFO L472 AbstractCegarLoop]: Abstraction has 2100 states and 3458 transitions. [2018-07-25 13:17:30,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3458 transitions. [2018-07-25 13:17:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:30,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:30,439 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:30,439 INFO L415 AbstractCegarLoop]: === Iteration 83 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2095454951, now seen corresponding path program 2 times [2018-07-25 13:17:30,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:30,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:30,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:30,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:30,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:30,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:30,458 INFO L87 Difference]: Start difference. First operand 2100 states and 3458 transitions. Second operand 12 states. [2018-07-25 13:17:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:31,698 INFO L93 Difference]: Finished difference Result 2277 states and 3736 transitions. [2018-07-25 13:17:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:17:31,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:31,701 INFO L225 Difference]: With dead ends: 2277 [2018-07-25 13:17:31,701 INFO L226 Difference]: Without dead ends: 2275 [2018-07-25 13:17:31,702 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:17:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2018-07-25 13:17:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2170. [2018-07-25 13:17:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-07-25 13:17:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3573 transitions. [2018-07-25 13:17:32,723 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3573 transitions. Word has length 19 [2018-07-25 13:17:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:32,723 INFO L472 AbstractCegarLoop]: Abstraction has 2170 states and 3573 transitions. [2018-07-25 13:17:32,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3573 transitions. [2018-07-25 13:17:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:32,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:32,725 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:32,725 INFO L415 AbstractCegarLoop]: === Iteration 84 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1599772939, now seen corresponding path program 3 times [2018-07-25 13:17:32,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:32,741 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:32,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:32,742 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:32,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:32,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:32,742 INFO L87 Difference]: Start difference. First operand 2170 states and 3573 transitions. Second operand 12 states. [2018-07-25 13:17:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:34,202 INFO L93 Difference]: Finished difference Result 2400 states and 3933 transitions. [2018-07-25 13:17:34,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:17:34,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:34,205 INFO L225 Difference]: With dead ends: 2400 [2018-07-25 13:17:34,206 INFO L226 Difference]: Without dead ends: 2398 [2018-07-25 13:17:34,206 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:17:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2018-07-25 13:17:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2146. [2018-07-25 13:17:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-07-25 13:17:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3536 transitions. [2018-07-25 13:17:35,246 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3536 transitions. Word has length 19 [2018-07-25 13:17:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:35,246 INFO L472 AbstractCegarLoop]: Abstraction has 2146 states and 3536 transitions. [2018-07-25 13:17:35,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3536 transitions. [2018-07-25 13:17:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:35,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:35,247 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:35,248 INFO L415 AbstractCegarLoop]: === Iteration 85 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1654744567, now seen corresponding path program 1 times [2018-07-25 13:17:35,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:17:35,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:35,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:17:35,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:35,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:35,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:35,260 INFO L87 Difference]: Start difference. First operand 2146 states and 3536 transitions. Second operand 8 states. [2018-07-25 13:17:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:36,593 INFO L93 Difference]: Finished difference Result 4383 states and 7138 transitions. [2018-07-25 13:17:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:17:36,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-07-25 13:17:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:36,595 INFO L225 Difference]: With dead ends: 4383 [2018-07-25 13:17:36,595 INFO L226 Difference]: Without dead ends: 2069 [2018-07-25 13:17:36,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:17:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-25 13:17:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1775. [2018-07-25 13:17:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-07-25 13:17:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2940 transitions. [2018-07-25 13:17:37,466 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2940 transitions. Word has length 19 [2018-07-25 13:17:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:37,466 INFO L472 AbstractCegarLoop]: Abstraction has 1775 states and 2940 transitions. [2018-07-25 13:17:37,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2940 transitions. [2018-07-25 13:17:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:37,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:37,468 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:37,468 INFO L415 AbstractCegarLoop]: === Iteration 86 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-07-25 13:17:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:37,484 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:37,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:37,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:37,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:37,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:37,485 INFO L87 Difference]: Start difference. First operand 1775 states and 2940 transitions. Second operand 13 states. [2018-07-25 13:17:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:39,048 INFO L93 Difference]: Finished difference Result 2136 states and 3539 transitions. [2018-07-25 13:17:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:17:39,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:17:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:39,051 INFO L225 Difference]: With dead ends: 2136 [2018-07-25 13:17:39,051 INFO L226 Difference]: Without dead ends: 2134 [2018-07-25 13:17:39,052 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:17:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-07-25 13:17:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1982. [2018-07-25 13:17:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-07-25 13:17:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3302 transitions. [2018-07-25 13:17:40,251 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3302 transitions. Word has length 19 [2018-07-25 13:17:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:40,251 INFO L472 AbstractCegarLoop]: Abstraction has 1982 states and 3302 transitions. [2018-07-25 13:17:40,251 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3302 transitions. [2018-07-25 13:17:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:40,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:40,253 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:40,253 INFO L415 AbstractCegarLoop]: === Iteration 87 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-07-25 13:17:40,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:40,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:40,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:40,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:40,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:40,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:40,272 INFO L87 Difference]: Start difference. First operand 1982 states and 3302 transitions. Second operand 13 states. [2018-07-25 13:17:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:42,669 INFO L93 Difference]: Finished difference Result 2923 states and 4923 transitions. [2018-07-25 13:17:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:17:42,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:17:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:42,672 INFO L225 Difference]: With dead ends: 2923 [2018-07-25 13:17:42,672 INFO L226 Difference]: Without dead ends: 2921 [2018-07-25 13:17:42,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:17:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-07-25 13:17:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2165. [2018-07-25 13:17:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-07-25 13:17:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3628 transitions. [2018-07-25 13:17:43,787 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3628 transitions. Word has length 19 [2018-07-25 13:17:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:43,787 INFO L472 AbstractCegarLoop]: Abstraction has 2165 states and 3628 transitions. [2018-07-25 13:17:43,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3628 transitions. [2018-07-25 13:17:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:43,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:43,789 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:43,789 INFO L415 AbstractCegarLoop]: === Iteration 88 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1180644619, now seen corresponding path program 1 times [2018-07-25 13:17:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:43,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:43,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:43,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:43,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:43,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:43,807 INFO L87 Difference]: Start difference. First operand 2165 states and 3628 transitions. Second operand 12 states. [2018-07-25 13:17:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:45,516 INFO L93 Difference]: Finished difference Result 2392 states and 3991 transitions. [2018-07-25 13:17:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:17:45,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:45,519 INFO L225 Difference]: With dead ends: 2392 [2018-07-25 13:17:45,519 INFO L226 Difference]: Without dead ends: 2391 [2018-07-25 13:17:45,519 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:17:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-07-25 13:17:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2238. [2018-07-25 13:17:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-07-25 13:17:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3754 transitions. [2018-07-25 13:17:46,681 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3754 transitions. Word has length 19 [2018-07-25 13:17:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,681 INFO L472 AbstractCegarLoop]: Abstraction has 2238 states and 3754 transitions. [2018-07-25 13:17:46,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3754 transitions. [2018-07-25 13:17:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:46,683 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,683 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:46,683 INFO L415 AbstractCegarLoop]: === Iteration 89 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1537034535, now seen corresponding path program 1 times [2018-07-25 13:17:46,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:46,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:46,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:46,701 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:46,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:46,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:46,701 INFO L87 Difference]: Start difference. First operand 2238 states and 3754 transitions. Second operand 12 states. [2018-07-25 13:17:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:48,450 INFO L93 Difference]: Finished difference Result 2500 states and 4176 transitions. [2018-07-25 13:17:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:17:48,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:48,453 INFO L225 Difference]: With dead ends: 2500 [2018-07-25 13:17:48,453 INFO L226 Difference]: Without dead ends: 2498 [2018-07-25 13:17:48,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:17:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2018-07-25 13:17:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2319. [2018-07-25 13:17:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-07-25 13:17:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3903 transitions. [2018-07-25 13:17:49,744 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3903 transitions. Word has length 19 [2018-07-25 13:17:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:49,744 INFO L472 AbstractCegarLoop]: Abstraction has 2319 states and 3903 transitions. [2018-07-25 13:17:49,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3903 transitions. [2018-07-25 13:17:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:49,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:49,746 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:49,746 INFO L415 AbstractCegarLoop]: === Iteration 90 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1313246452, now seen corresponding path program 2 times [2018-07-25 13:17:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:49,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:49,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:49,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:49,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:49,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:49,759 INFO L87 Difference]: Start difference. First operand 2319 states and 3903 transitions. Second operand 13 states. [2018-07-25 13:17:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:52,036 INFO L93 Difference]: Finished difference Result 3166 states and 5350 transitions. [2018-07-25 13:17:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:17:52,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:17:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:52,041 INFO L225 Difference]: With dead ends: 3166 [2018-07-25 13:17:52,041 INFO L226 Difference]: Without dead ends: 3164 [2018-07-25 13:17:52,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:17:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2018-07-25 13:17:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2660. [2018-07-25 13:17:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-07-25 13:17:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4506 transitions. [2018-07-25 13:17:53,507 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4506 transitions. Word has length 19 [2018-07-25 13:17:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:53,507 INFO L472 AbstractCegarLoop]: Abstraction has 2660 states and 4506 transitions. [2018-07-25 13:17:53,507 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4506 transitions. [2018-07-25 13:17:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:53,508 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:53,509 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:53,509 INFO L415 AbstractCegarLoop]: === Iteration 91 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1262707917, now seen corresponding path program 1 times [2018-07-25 13:17:53,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:53,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:53,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:53,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:53,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:53,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:53,531 INFO L87 Difference]: Start difference. First operand 2660 states and 4506 transitions. Second operand 12 states. [2018-07-25 13:17:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:55,439 INFO L93 Difference]: Finished difference Result 2926 states and 4919 transitions. [2018-07-25 13:17:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:17:55,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:55,442 INFO L225 Difference]: With dead ends: 2926 [2018-07-25 13:17:55,442 INFO L226 Difference]: Without dead ends: 2925 [2018-07-25 13:17:55,443 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:17:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2018-07-25 13:17:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2743. [2018-07-25 13:17:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2018-07-25 13:17:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4635 transitions. [2018-07-25 13:17:57,024 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4635 transitions. Word has length 19 [2018-07-25 13:17:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:57,024 INFO L472 AbstractCegarLoop]: Abstraction has 2743 states and 4635 transitions. [2018-07-25 13:17:57,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4635 transitions. [2018-07-25 13:17:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:17:57,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:57,025 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:57,026 INFO L415 AbstractCegarLoop]: === Iteration 92 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1454971237, now seen corresponding path program 1 times [2018-07-25 13:17:57,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:57,041 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:57,041 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:57,041 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:57,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:57,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:57,042 INFO L87 Difference]: Start difference. First operand 2743 states and 4635 transitions. Second operand 12 states. [2018-07-25 13:17:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:59,184 INFO L93 Difference]: Finished difference Result 3133 states and 5275 transitions. [2018-07-25 13:17:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:17:59,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:17:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:59,187 INFO L225 Difference]: With dead ends: 3133 [2018-07-25 13:17:59,187 INFO L226 Difference]: Without dead ends: 3131 [2018-07-25 13:17:59,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:17:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-07-25 13:18:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2801. [2018-07-25 13:18:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-07-25 13:18:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4743 transitions. [2018-07-25 13:18:00,827 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4743 transitions. Word has length 19 [2018-07-25 13:18:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:00,827 INFO L472 AbstractCegarLoop]: Abstraction has 2801 states and 4743 transitions. [2018-07-25 13:18:00,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4743 transitions. [2018-07-25 13:18:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:18:00,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:00,828 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:00,828 INFO L415 AbstractCegarLoop]: === Iteration 93 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1425507486, now seen corresponding path program 1 times [2018-07-25 13:18:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:00,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:00,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:00,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:00,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:00,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:00,848 INFO L87 Difference]: Start difference. First operand 2801 states and 4743 transitions. Second operand 12 states. [2018-07-25 13:18:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:02,708 INFO L93 Difference]: Finished difference Result 2901 states and 4876 transitions. [2018-07-25 13:18:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:18:02,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 13:18:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:02,711 INFO L225 Difference]: With dead ends: 2901 [2018-07-25 13:18:02,712 INFO L226 Difference]: Without dead ends: 2899 [2018-07-25 13:18:02,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:18:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-07-25 13:18:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2806. [2018-07-25 13:18:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-07-25 13:18:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4747 transitions. [2018-07-25 13:18:04,384 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4747 transitions. Word has length 19 [2018-07-25 13:18:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:04,384 INFO L472 AbstractCegarLoop]: Abstraction has 2806 states and 4747 transitions. [2018-07-25 13:18:04,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4747 transitions. [2018-07-25 13:18:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:18:04,386 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:04,386 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:04,386 INFO L415 AbstractCegarLoop]: === Iteration 94 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1340518044, now seen corresponding path program 3 times [2018-07-25 13:18:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:04,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:04,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:18:04,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:18:04,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:18:04,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:18:04,403 INFO L87 Difference]: Start difference. First operand 2806 states and 4747 transitions. Second operand 13 states. [2018-07-25 13:18:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:06,255 INFO L93 Difference]: Finished difference Result 2882 states and 4840 transitions. [2018-07-25 13:18:06,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:18:06,255 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:18:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:06,258 INFO L225 Difference]: With dead ends: 2882 [2018-07-25 13:18:06,258 INFO L226 Difference]: Without dead ends: 2881 [2018-07-25 13:18:06,259 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:18:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-07-25 13:18:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2808. [2018-07-25 13:18:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-07-25 13:18:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4749 transitions. [2018-07-25 13:18:07,939 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4749 transitions. Word has length 19 [2018-07-25 13:18:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:07,939 INFO L472 AbstractCegarLoop]: Abstraction has 2808 states and 4749 transitions. [2018-07-25 13:18:07,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:18:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4749 transitions. [2018-07-25 13:18:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:07,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:07,941 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:07,941 INFO L415 AbstractCegarLoop]: === Iteration 95 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 2 times [2018-07-25 13:18:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:07,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:07,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:18:07,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:18:07,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:18:07,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:18:07,958 INFO L87 Difference]: Start difference. First operand 2808 states and 4749 transitions. Second operand 13 states. [2018-07-25 13:18:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:09,898 INFO L93 Difference]: Finished difference Result 2926 states and 4924 transitions. [2018-07-25 13:18:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:18:09,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 13:18:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:09,901 INFO L225 Difference]: With dead ends: 2926 [2018-07-25 13:18:09,901 INFO L226 Difference]: Without dead ends: 2924 [2018-07-25 13:18:09,902 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:18:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2018-07-25 13:18:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2802. [2018-07-25 13:18:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-07-25 13:18:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4737 transitions. [2018-07-25 13:18:11,575 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4737 transitions. Word has length 21 [2018-07-25 13:18:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:11,575 INFO L472 AbstractCegarLoop]: Abstraction has 2802 states and 4737 transitions. [2018-07-25 13:18:11,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:18:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4737 transitions. [2018-07-25 13:18:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:11,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:11,577 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:11,577 INFO L415 AbstractCegarLoop]: === Iteration 96 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1322152835, now seen corresponding path program 1 times [2018-07-25 13:18:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:11,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:11,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:11,593 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:11,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:11,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:11,593 INFO L87 Difference]: Start difference. First operand 2802 states and 4737 transitions. Second operand 12 states. [2018-07-25 13:18:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:13,537 INFO L93 Difference]: Finished difference Result 2956 states and 4972 transitions. [2018-07-25 13:18:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:18:13,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:13,540 INFO L225 Difference]: With dead ends: 2956 [2018-07-25 13:18:13,540 INFO L226 Difference]: Without dead ends: 2954 [2018-07-25 13:18:13,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:18:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-07-25 13:18:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2817. [2018-07-25 13:18:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-07-25 13:18:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4761 transitions. [2018-07-25 13:18:15,237 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4761 transitions. Word has length 21 [2018-07-25 13:18:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:15,238 INFO L472 AbstractCegarLoop]: Abstraction has 2817 states and 4761 transitions. [2018-07-25 13:18:15,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4761 transitions. [2018-07-25 13:18:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:15,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:15,239 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:15,240 INFO L415 AbstractCegarLoop]: === Iteration 97 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash 277164812, now seen corresponding path program 1 times [2018-07-25 13:18:15,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:15,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:15,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:15,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:15,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:15,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:15,252 INFO L87 Difference]: Start difference. First operand 2817 states and 4761 transitions. Second operand 12 states. [2018-07-25 13:18:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:17,392 INFO L93 Difference]: Finished difference Result 3140 states and 5289 transitions. [2018-07-25 13:18:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:18:17,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:17,395 INFO L225 Difference]: With dead ends: 3140 [2018-07-25 13:18:17,395 INFO L226 Difference]: Without dead ends: 3138 [2018-07-25 13:18:17,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:18:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-07-25 13:18:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2900. [2018-07-25 13:18:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2018-07-25 13:18:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4905 transitions. [2018-07-25 13:18:19,111 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4905 transitions. Word has length 21 [2018-07-25 13:18:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:19,112 INFO L472 AbstractCegarLoop]: Abstraction has 2900 states and 4905 transitions. [2018-07-25 13:18:19,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4905 transitions. [2018-07-25 13:18:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:19,113 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:19,114 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:19,114 INFO L415 AbstractCegarLoop]: === Iteration 98 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2146104337, now seen corresponding path program 2 times [2018-07-25 13:18:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:19,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:19,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:19,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:19,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:19,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:19,129 INFO L87 Difference]: Start difference. First operand 2900 states and 4905 transitions. Second operand 12 states. [2018-07-25 13:18:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:21,372 INFO L93 Difference]: Finished difference Result 3107 states and 5227 transitions. [2018-07-25 13:18:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:18:21,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:21,376 INFO L225 Difference]: With dead ends: 3107 [2018-07-25 13:18:21,376 INFO L226 Difference]: Without dead ends: 3105 [2018-07-25 13:18:21,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:18:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2018-07-25 13:18:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2911. [2018-07-25 13:18:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-07-25 13:18:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4924 transitions. [2018-07-25 13:18:23,144 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4924 transitions. Word has length 21 [2018-07-25 13:18:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:23,144 INFO L472 AbstractCegarLoop]: Abstraction has 2911 states and 4924 transitions. [2018-07-25 13:18:23,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4924 transitions. [2018-07-25 13:18:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:23,146 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:23,146 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:23,146 INFO L415 AbstractCegarLoop]: === Iteration 99 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1101116314, now seen corresponding path program 2 times [2018-07-25 13:18:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:23,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:23,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:23,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:23,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:23,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:23,163 INFO L87 Difference]: Start difference. First operand 2911 states and 4924 transitions. Second operand 12 states. [2018-07-25 13:18:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:25,297 INFO L93 Difference]: Finished difference Result 3164 states and 5332 transitions. [2018-07-25 13:18:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:18:25,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:25,300 INFO L225 Difference]: With dead ends: 3164 [2018-07-25 13:18:25,301 INFO L226 Difference]: Without dead ends: 3162 [2018-07-25 13:18:25,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:18:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2018-07-25 13:18:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2915. [2018-07-25 13:18:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-07-25 13:18:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4930 transitions. [2018-07-25 13:18:27,087 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4930 transitions. Word has length 21 [2018-07-25 13:18:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:27,088 INFO L472 AbstractCegarLoop]: Abstraction has 2915 states and 4930 transitions. [2018-07-25 13:18:27,088 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4930 transitions. [2018-07-25 13:18:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:27,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:27,089 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:27,089 INFO L415 AbstractCegarLoop]: === Iteration 100 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -825971080, now seen corresponding path program 3 times [2018-07-25 13:18:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:27,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:27,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:27,104 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:27,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:27,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:27,104 INFO L87 Difference]: Start difference. First operand 2915 states and 4930 transitions. Second operand 12 states. [2018-07-25 13:18:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:29,354 INFO L93 Difference]: Finished difference Result 3286 states and 5534 transitions. [2018-07-25 13:18:29,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:18:29,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:29,358 INFO L225 Difference]: With dead ends: 3286 [2018-07-25 13:18:29,358 INFO L226 Difference]: Without dead ends: 3284 [2018-07-25 13:18:29,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:18:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-07-25 13:18:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2815. [2018-07-25 13:18:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2018-07-25 13:18:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4765 transitions. [2018-07-25 13:18:31,076 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4765 transitions. Word has length 21 [2018-07-25 13:18:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:31,076 INFO L472 AbstractCegarLoop]: Abstraction has 2815 states and 4765 transitions. [2018-07-25 13:18:31,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4765 transitions. [2018-07-25 13:18:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:31,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:31,078 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:18:31,078 INFO L415 AbstractCegarLoop]: === Iteration 101 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 3 times [2018-07-25 13:18:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:31,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:31,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:31,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:31,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:31,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:31,092 INFO L87 Difference]: Start difference. First operand 2815 states and 4765 transitions. Second operand 12 states. [2018-07-25 13:18:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:33,782 INFO L93 Difference]: Finished difference Result 3830 states and 6471 transitions. [2018-07-25 13:18:33,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:18:33,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:33,787 INFO L225 Difference]: With dead ends: 3830 [2018-07-25 13:18:33,787 INFO L226 Difference]: Without dead ends: 3828 [2018-07-25 13:18:33,788 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:18:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2018-07-25 13:18:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3225. [2018-07-25 13:18:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2018-07-25 13:18:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5464 transitions. [2018-07-25 13:18:35,707 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5464 transitions. Word has length 21 [2018-07-25 13:18:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:35,707 INFO L472 AbstractCegarLoop]: Abstraction has 3225 states and 5464 transitions. [2018-07-25 13:18:35,707 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5464 transitions. [2018-07-25 13:18:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:35,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:35,709 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:18:35,709 INFO L415 AbstractCegarLoop]: === Iteration 102 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:35,709 INFO L82 PathProgramCache]: Analyzing trace with hash -790589419, now seen corresponding path program 4 times [2018-07-25 13:18:35,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:35,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:35,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:35,720 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:35,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:35,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:35,721 INFO L87 Difference]: Start difference. First operand 3225 states and 5464 transitions. Second operand 12 states. [2018-07-25 13:18:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:38,552 INFO L93 Difference]: Finished difference Result 3932 states and 6616 transitions. [2018-07-25 13:18:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:18:38,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:38,557 INFO L225 Difference]: With dead ends: 3932 [2018-07-25 13:18:38,557 INFO L226 Difference]: Without dead ends: 3930 [2018-07-25 13:18:38,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:18:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-07-25 13:18:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3379. [2018-07-25 13:18:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3379 states. [2018-07-25 13:18:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5726 transitions. [2018-07-25 13:18:40,587 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5726 transitions. Word has length 21 [2018-07-25 13:18:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:40,587 INFO L472 AbstractCegarLoop]: Abstraction has 3379 states and 5726 transitions. [2018-07-25 13:18:40,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5726 transitions. [2018-07-25 13:18:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:40,589 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:40,589 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:18:40,589 INFO L415 AbstractCegarLoop]: === Iteration 103 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1656473859, now seen corresponding path program 1 times [2018-07-25 13:18:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:40,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:40,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:40,604 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:40,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:40,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:40,605 INFO L87 Difference]: Start difference. First operand 3379 states and 5726 transitions. Second operand 12 states. [2018-07-25 13:18:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:43,685 INFO L93 Difference]: Finished difference Result 4115 states and 6953 transitions. [2018-07-25 13:18:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:18:43,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:43,689 INFO L225 Difference]: With dead ends: 4115 [2018-07-25 13:18:43,690 INFO L226 Difference]: Without dead ends: 4113 [2018-07-25 13:18:43,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:18:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-07-25 13:18:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3490. [2018-07-25 13:18:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-07-25 13:18:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5892 transitions. [2018-07-25 13:18:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5892 transitions. Word has length 21 [2018-07-25 13:18:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:45,867 INFO L472 AbstractCegarLoop]: Abstraction has 3490 states and 5892 transitions. [2018-07-25 13:18:45,867 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5892 transitions. [2018-07-25 13:18:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:45,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:45,868 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:18:45,869 INFO L415 AbstractCegarLoop]: === Iteration 104 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1656474147, now seen corresponding path program 5 times [2018-07-25 13:18:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:45,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:45,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:45,887 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:45,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:45,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:45,888 INFO L87 Difference]: Start difference. First operand 3490 states and 5892 transitions. Second operand 12 states. [2018-07-25 13:18:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:49,081 INFO L93 Difference]: Finished difference Result 4077 states and 6809 transitions. [2018-07-25 13:18:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:18:49,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:18:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:49,086 INFO L225 Difference]: With dead ends: 4077 [2018-07-25 13:18:49,086 INFO L226 Difference]: Without dead ends: 4075 [2018-07-25 13:18:49,087 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:18:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-07-25 13:18:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3523. [2018-07-25 13:18:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2018-07-25 13:18:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5952 transitions. [2018-07-25 13:18:51,288 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5952 transitions. Word has length 21 [2018-07-25 13:18:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:51,288 INFO L472 AbstractCegarLoop]: Abstraction has 3523 states and 5952 transitions. [2018-07-25 13:18:51,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:18:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5952 transitions. [2018-07-25 13:18:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:51,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:51,290 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:18:51,290 INFO L415 AbstractCegarLoop]: === Iteration 105 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:51,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1665062316, now seen corresponding path program 2 times [2018-07-25 13:18:51,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:51,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:51,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:51,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:18:51,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:18:51,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:18:51,306 INFO L87 Difference]: Start difference. First operand 3523 states and 5952 transitions. Second operand 13 states. [2018-07-25 13:18:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:54,713 INFO L93 Difference]: Finished difference Result 4708 states and 7968 transitions. [2018-07-25 13:18:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:18:54,713 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 13:18:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:54,717 INFO L225 Difference]: With dead ends: 4708 [2018-07-25 13:18:54,717 INFO L226 Difference]: Without dead ends: 4706 [2018-07-25 13:18:54,718 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:18:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2018-07-25 13:18:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3926. [2018-07-25 13:18:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2018-07-25 13:18:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 6652 transitions. [2018-07-25 13:18:57,061 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 6652 transitions. Word has length 21 [2018-07-25 13:18:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:57,062 INFO L472 AbstractCegarLoop]: Abstraction has 3926 states and 6652 transitions. [2018-07-25 13:18:57,062 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:18:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 6652 transitions. [2018-07-25 13:18:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:18:57,063 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:57,063 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:57,063 INFO L415 AbstractCegarLoop]: === Iteration 106 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1944645353, now seen corresponding path program 1 times [2018-07-25 13:18:57,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:57,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:57,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:18:57,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:18:57,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:18:57,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:18:57,076 INFO L87 Difference]: Start difference. First operand 3926 states and 6652 transitions. Second operand 12 states. [2018-07-25 13:19:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:00,498 INFO L93 Difference]: Finished difference Result 4890 states and 8270 transitions. [2018-07-25 13:19:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:00,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:00,502 INFO L225 Difference]: With dead ends: 4890 [2018-07-25 13:19:00,503 INFO L226 Difference]: Without dead ends: 4888 [2018-07-25 13:19:00,503 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2018-07-25 13:19:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4312. [2018-07-25 13:19:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states. [2018-07-25 13:19:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 7318 transitions. [2018-07-25 13:19:03,032 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 7318 transitions. Word has length 21 [2018-07-25 13:19:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:03,032 INFO L472 AbstractCegarLoop]: Abstraction has 4312 states and 7318 transitions. [2018-07-25 13:19:03,032 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 7318 transitions. [2018-07-25 13:19:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:03,033 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:03,033 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:03,034 INFO L415 AbstractCegarLoop]: === Iteration 107 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash 502417925, now seen corresponding path program 1 times [2018-07-25 13:19:03,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:03,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:03,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:03,047 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:03,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:03,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:03,048 INFO L87 Difference]: Start difference. First operand 4312 states and 7318 transitions. Second operand 12 states. [2018-07-25 13:19:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:07,080 INFO L93 Difference]: Finished difference Result 5047 states and 8540 transitions. [2018-07-25 13:19:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:07,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:07,087 INFO L225 Difference]: With dead ends: 5047 [2018-07-25 13:19:07,087 INFO L226 Difference]: Without dead ends: 5045 [2018-07-25 13:19:07,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2018-07-25 13:19:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4470. [2018-07-25 13:19:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2018-07-25 13:19:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 7567 transitions. [2018-07-25 13:19:09,823 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 7567 transitions. Word has length 21 [2018-07-25 13:19:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:09,823 INFO L472 AbstractCegarLoop]: Abstraction has 4470 states and 7567 transitions. [2018-07-25 13:19:09,823 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 7567 transitions. [2018-07-25 13:19:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:09,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:09,825 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:09,825 INFO L415 AbstractCegarLoop]: === Iteration 108 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 502418213, now seen corresponding path program 2 times [2018-07-25 13:19:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:09,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:09,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:09,841 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:09,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:09,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:09,841 INFO L87 Difference]: Start difference. First operand 4470 states and 7567 transitions. Second operand 12 states. [2018-07-25 13:19:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:13,558 INFO L93 Difference]: Finished difference Result 5152 states and 8677 transitions. [2018-07-25 13:19:13,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:19:13,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:13,562 INFO L225 Difference]: With dead ends: 5152 [2018-07-25 13:19:13,563 INFO L226 Difference]: Without dead ends: 5150 [2018-07-25 13:19:13,563 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:19:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2018-07-25 13:19:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 4477. [2018-07-25 13:19:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states. [2018-07-25 13:19:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7584 transitions. [2018-07-25 13:19:16,222 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7584 transitions. Word has length 21 [2018-07-25 13:19:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:16,222 INFO L472 AbstractCegarLoop]: Abstraction has 4477 states and 7584 transitions. [2018-07-25 13:19:16,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7584 transitions. [2018-07-25 13:19:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:16,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:16,224 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:16,224 INFO L415 AbstractCegarLoop]: === Iteration 109 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 511006382, now seen corresponding path program 2 times [2018-07-25 13:19:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:16,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:16,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:16,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:19:16,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:19:16,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:16,240 INFO L87 Difference]: Start difference. First operand 4477 states and 7584 transitions. Second operand 13 states. [2018-07-25 13:19:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:20,132 INFO L93 Difference]: Finished difference Result 5562 states and 9455 transitions. [2018-07-25 13:19:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:19:20,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 13:19:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:20,138 INFO L225 Difference]: With dead ends: 5562 [2018-07-25 13:19:20,138 INFO L226 Difference]: Without dead ends: 5560 [2018-07-25 13:19:20,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2018-07-25 13:19:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4895. [2018-07-25 13:19:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-07-25 13:19:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 8338 transitions. [2018-07-25 13:19:23,151 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 8338 transitions. Word has length 21 [2018-07-25 13:19:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:23,152 INFO L472 AbstractCegarLoop]: Abstraction has 4895 states and 8338 transitions. [2018-07-25 13:19:23,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:19:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 8338 transitions. [2018-07-25 13:19:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:23,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:23,153 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:23,153 INFO L415 AbstractCegarLoop]: === Iteration 110 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744866, now seen corresponding path program 1 times [2018-07-25 13:19:23,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:23,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:23,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:23,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:23,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:23,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:23,168 INFO L87 Difference]: Start difference. First operand 4895 states and 8338 transitions. Second operand 12 states. [2018-07-25 13:19:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:27,155 INFO L93 Difference]: Finished difference Result 5795 states and 9885 transitions. [2018-07-25 13:19:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:19:27,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:27,160 INFO L225 Difference]: With dead ends: 5795 [2018-07-25 13:19:27,160 INFO L226 Difference]: Without dead ends: 5793 [2018-07-25 13:19:27,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:19:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2018-07-25 13:19:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5351. [2018-07-25 13:19:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2018-07-25 13:19:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 9168 transitions. [2018-07-25 13:19:30,425 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 9168 transitions. Word has length 21 [2018-07-25 13:19:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:30,425 INFO L472 AbstractCegarLoop]: Abstraction has 5351 states and 9168 transitions. [2018-07-25 13:19:30,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 9168 transitions. [2018-07-25 13:19:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:30,427 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:30,427 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:19:30,427 INFO L415 AbstractCegarLoop]: === Iteration 111 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:30,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1195981155, now seen corresponding path program 3 times [2018-07-25 13:19:30,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:30,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:30,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:30,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:30,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:30,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:30,445 INFO L87 Difference]: Start difference. First operand 5351 states and 9168 transitions. Second operand 12 states. [2018-07-25 13:19:30,673 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-07-25 13:19:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:34,992 INFO L93 Difference]: Finished difference Result 6216 states and 10633 transitions. [2018-07-25 13:19:34,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:34,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:34,997 INFO L225 Difference]: With dead ends: 6216 [2018-07-25 13:19:34,997 INFO L226 Difference]: Without dead ends: 6214 [2018-07-25 13:19:34,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2018-07-25 13:19:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5792. [2018-07-25 13:19:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5792 states. [2018-07-25 13:19:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 9945 transitions. [2018-07-25 13:19:38,523 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 9945 transitions. Word has length 21 [2018-07-25 13:19:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:38,524 INFO L472 AbstractCegarLoop]: Abstraction has 5792 states and 9945 transitions. [2018-07-25 13:19:38,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 9945 transitions. [2018-07-25 13:19:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:38,525 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:38,525 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:38,526 INFO L415 AbstractCegarLoop]: === Iteration 112 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1244712345, now seen corresponding path program 1 times [2018-07-25 13:19:38,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:19:38,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:38,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:38,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:38,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:38,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:38,541 INFO L87 Difference]: Start difference. First operand 5792 states and 9945 transitions. Second operand 12 states. [2018-07-25 13:19:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:43,793 INFO L93 Difference]: Finished difference Result 6775 states and 11608 transitions. [2018-07-25 13:19:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:19:43,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:43,799 INFO L225 Difference]: With dead ends: 6775 [2018-07-25 13:19:43,799 INFO L226 Difference]: Without dead ends: 6773 [2018-07-25 13:19:43,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2018-07-25 13:19:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5546. [2018-07-25 13:19:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-07-25 13:19:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 9498 transitions. [2018-07-25 13:19:47,361 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 9498 transitions. Word has length 21 [2018-07-25 13:19:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:47,361 INFO L472 AbstractCegarLoop]: Abstraction has 5546 states and 9498 transitions. [2018-07-25 13:19:47,361 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 9498 transitions. [2018-07-25 13:19:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:47,363 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:47,363 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:19:47,363 INFO L415 AbstractCegarLoop]: === Iteration 113 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 6 times [2018-07-25 13:19:47,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:47,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:47,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:47,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:47,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:47,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:47,385 INFO L87 Difference]: Start difference. First operand 5546 states and 9498 transitions. Second operand 12 states. [2018-07-25 13:19:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,820 INFO L93 Difference]: Finished difference Result 7993 states and 13790 transitions. [2018-07-25 13:19:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:53,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:19:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,829 INFO L225 Difference]: With dead ends: 7993 [2018-07-25 13:19:53,829 INFO L226 Difference]: Without dead ends: 7991 [2018-07-25 13:19:53,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-07-25 13:19:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 6894. [2018-07-25 13:19:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2018-07-25 13:19:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11875 transitions. [2018-07-25 13:19:58,481 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11875 transitions. Word has length 21 [2018-07-25 13:19:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:58,481 INFO L472 AbstractCegarLoop]: Abstraction has 6894 states and 11875 transitions. [2018-07-25 13:19:58,481 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11875 transitions. [2018-07-25 13:19:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:58,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:58,483 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:19:58,483 INFO L415 AbstractCegarLoop]: === Iteration 114 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 3 times [2018-07-25 13:19:58,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:58,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:58,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:58,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:58,499 INFO L87 Difference]: Start difference. First operand 6894 states and 11875 transitions. Second operand 12 states. [2018-07-25 13:20:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:05,427 INFO L93 Difference]: Finished difference Result 8437 states and 14562 transitions. [2018-07-25 13:20:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:20:05,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:20:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:05,438 INFO L225 Difference]: With dead ends: 8437 [2018-07-25 13:20:05,438 INFO L226 Difference]: Without dead ends: 8435 [2018-07-25 13:20:05,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:20:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2018-07-25 13:20:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 7260. [2018-07-25 13:20:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2018-07-25 13:20:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 12485 transitions. [2018-07-25 13:20:10,220 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 12485 transitions. Word has length 21 [2018-07-25 13:20:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:10,220 INFO L472 AbstractCegarLoop]: Abstraction has 7260 states and 12485 transitions. [2018-07-25 13:20:10,220 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:20:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 12485 transitions. [2018-07-25 13:20:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:20:10,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:10,222 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:20:10,222 INFO L415 AbstractCegarLoop]: === Iteration 115 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash 274158605, now seen corresponding path program 7 times [2018-07-25 13:20:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:10,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:10,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:20:10,236 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:20:10,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:20:10,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:20:10,236 INFO L87 Difference]: Start difference. First operand 7260 states and 12485 transitions. Second operand 12 states. [2018-07-25 13:20:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:17,403 INFO L93 Difference]: Finished difference Result 8575 states and 14718 transitions. [2018-07-25 13:20:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:20:17,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:20:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:17,413 INFO L225 Difference]: With dead ends: 8575 [2018-07-25 13:20:17,413 INFO L226 Difference]: Without dead ends: 8573 [2018-07-25 13:20:17,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:20:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2018-07-25 13:20:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 7185. [2018-07-25 13:20:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2018-07-25 13:20:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 12367 transitions. [2018-07-25 13:20:22,162 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 12367 transitions. Word has length 21 [2018-07-25 13:20:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:22,162 INFO L472 AbstractCegarLoop]: Abstraction has 7185 states and 12367 transitions. [2018-07-25 13:20:22,162 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:20:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 12367 transitions. [2018-07-25 13:20:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:20:22,164 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:22,164 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:20:22,164 INFO L415 AbstractCegarLoop]: === Iteration 116 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 282746774, now seen corresponding path program 4 times [2018-07-25 13:20:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:22,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:22,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:20:22,176 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:20:22,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:20:22,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:20:22,177 INFO L87 Difference]: Start difference. First operand 7185 states and 12367 transitions. Second operand 12 states. Received shutdown request... [2018-07-25 13:20:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:20:27,341 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:20:27,348 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:20:27,348 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:20:27 BoogieIcfgContainer [2018-07-25 13:20:27,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:20:27,349 INFO L168 Benchmark]: Toolchain (without parser) took 256323.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -85.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 13:20:27,351 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:27,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:27,352 INFO L168 Benchmark]: Boogie Preprocessor took 22.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:27,352 INFO L168 Benchmark]: RCFGBuilder took 256.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:27,353 INFO L168 Benchmark]: TraceAbstraction took 255997.65 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -95.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 13:20:27,356 INFO L336 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 256.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255997.65 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -95.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6035 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6035 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6035 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6035 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 255.9s OverallTime, 116 OverallIterations, 4 TraceHistogramMax, 150.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4227 SDtfs, 10887 SDslu, 9239 SDs, 0 SdLazy, 61320 SolverSat, 5404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2552 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12288 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7260occurred in iteration=114, 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: 102.9s AutomataMinimizationTime, 115 MinimizatonAttempts, 23605 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1771 NumberOfCodeBlocks, 1771 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 1655 ConstructedInterpolants, 0 QuantifiedInterpolants, 170266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 7 PerfectInterpolantSequences, 133/1161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-20-27-366.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-20-27-366.csv Completed graceful shutdown