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/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:28,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:28,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:28,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:28,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:28,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:28,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:28,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:28,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:28,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:28,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:28,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:28,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:28,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:28,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:28,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:28,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:28,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:28,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:28,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:28,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:28,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:28,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:28,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:28,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:28,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:28,846 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:28,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:28,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:28,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:28,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:28,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:28,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:28,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:28,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:28,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:28,857 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:15:28,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:28,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:28,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:28,877 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:28,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:28,878 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:28,878 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:28,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:28,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:28,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:28,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:28,962 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:28,962 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:28,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-07-25 13:15:28,963 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-07-25 13:15:29,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:29,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:29,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:29,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:29,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:29,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,049 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:29,049 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:29,049 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:29,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:29,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:29,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:29,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:29,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:29,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:29,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:29,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:29,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/1) ... [2018-07-25 13:15:29,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:15:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:15:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:15:29,295 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:29,296 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:29 BoogieIcfgContainer [2018-07-25 13:15:29,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:29,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:29,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:29,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:29,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:28" (1/2) ... [2018-07-25 13:15:29,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707702c0 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:29, skipping insertion in model container [2018-07-25 13:15:29,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:29" (2/2) ... [2018-07-25 13:15:29,306 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-07-25 13:15:29,316 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:29,326 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:15:29,381 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:29,382 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:29,382 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:29,383 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:29,383 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:29,383 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:29,383 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:29,383 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:29,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:15:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:15:29,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:29,414 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:15:29,415 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-07-25 13:15:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:29,772 WARN L169 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-07-25 13:15:29,791 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:15:29,794 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:29,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:15:29,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:29,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:29,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:29,820 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2018-07-25 13:15:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:29,873 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:15:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:15:29,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 13:15:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:29,890 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:15:29,890 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:15:29,894 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:15:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-07-25 13:15:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:15:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:15:29,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-07-25 13:15:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:29,935 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:15:29,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:15:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:15:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:15:29,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:29,936 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:15:29,937 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-07-25 13:15:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:30,172 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:15:30,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:30,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:15:30,175 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:30,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:30,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:30,176 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 13:15:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:30,218 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:15:30,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:15:30,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:15:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:30,219 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:15:30,219 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:15:30,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:15:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-07-25 13:15:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:15:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:15:30,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-07-25 13:15:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:30,226 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:15:30,226 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:15:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:30,227 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:30,227 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-07-25 13:15:30,227 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-07-25 13:15:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:30,480 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:15:30,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:30,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:15:30,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:30,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:30,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:30,482 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:15:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:30,546 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:15:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:30,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:15:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:30,547 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:15:30,548 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:15:30,548 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:15:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-07-25 13:15:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:15:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:15:30,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-07-25 13:15:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:30,555 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:15:30,555 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:15:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:30,556 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:30,556 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-07-25 13:15:30,557 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-07-25 13:15:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:30,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:30,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:30,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:30,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:30,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:30,716 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-07-25 13:15:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:30,809 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:15:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:15:30,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-07-25 13:15:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:30,812 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:15:30,812 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:15:30,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:15:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-07-25 13:15:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:15:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:15:30,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-07-25 13:15:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:30,826 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:15:30,826 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:15:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:15:30,827 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:30,828 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-07-25 13:15:30,828 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-07-25 13:15:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:30,987 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:15:30,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:30,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:30,988 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:30,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:30,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:30,994 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-07-25 13:15:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:31,074 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:15:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:15:31,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 13:15:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:31,075 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:15:31,075 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:15:31,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:15:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-07-25 13:15:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:15:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:15:31,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-07-25 13:15:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:31,085 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:15:31,085 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:15:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:15:31,086 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:31,086 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-07-25 13:15:31,087 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-07-25 13:15:31,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:31,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:31,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:15:31,198 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:15:31,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:15:31,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:31,203 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-07-25 13:15:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:31,288 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:15:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:31,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-07-25 13:15:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:31,290 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:15:31,290 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:15:31,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:15:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-07-25 13:15:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:15:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:15:31,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-07-25 13:15:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:31,302 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:15:31,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:15:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:15:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:15:31,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:31,304 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-07-25 13:15:31,305 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-07-25 13:15:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:31,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:31,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:15:31,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:15:31,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:15:31,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:31,463 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2018-07-25 13:15:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:31,530 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:15:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:31,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:15:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:31,532 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:15:31,532 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:15:31,533 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:15:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-07-25 13:15:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:15:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:15:31,544 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-07-25 13:15:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:31,546 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:15:31,546 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:15:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:15:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:15:31,547 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:31,548 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-07-25 13:15:31,548 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-07-25 13:15:31,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:31,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:31,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:15:31,709 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:15:31,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:15:31,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:31,711 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2018-07-25 13:15:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:31,796 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:15:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:31,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:15:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:31,798 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:15:31,798 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:15:31,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:15:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-07-25 13:15:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:15:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:15:31,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-07-25 13:15:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:31,811 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:15:31,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:15:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:15:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:15:31,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:31,813 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-07-25 13:15:31,813 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-07-25 13:15:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:31,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:31,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:15:31,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:15:31,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:15:31,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:31,993 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-07-25 13:15:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:32,096 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:15:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:32,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 13:15:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:32,097 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:15:32,098 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:15:32,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:15:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-07-25 13:15:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:15:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:15:32,118 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-07-25 13:15:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:32,118 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:15:32,119 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:15:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:15:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:15:32,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:32,122 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-07-25 13:15:32,125 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-07-25 13:15:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:32,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:32,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:15:32,310 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:15:32,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:15:32,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:32,311 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-07-25 13:15:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:32,426 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:15:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:15:32,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-07-25 13:15:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:32,428 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:15:32,428 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:15:32,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:15:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-07-25 13:15:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:15:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:15:32,444 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-07-25 13:15:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:32,444 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:15:32,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:15:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:15:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:15:32,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:32,446 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-07-25 13:15:32,446 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-07-25 13:15:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:32,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:32,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:15:32,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:15:32,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:15:32,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:32,669 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2018-07-25 13:15:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:32,800 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:15:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:32,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 13:15:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:32,801 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:15:32,802 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:15:32,802 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:15:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-07-25 13:15:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:15:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:15:32,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-07-25 13:15:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:32,825 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:15:32,826 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:15:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:15:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:15:32,827 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:32,827 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-07-25 13:15:32,827 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-07-25 13:15:32,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:33,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:33,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:15:33,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:15:33,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:15:33,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:33,052 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 16 states. [2018-07-25 13:15:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,219 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:15:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:15:33,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:15:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,221 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:15:33,222 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:15:33,223 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:15:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-07-25 13:15:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:15:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:15:33,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-07-25 13:15:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,248 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:15:33,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:15:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:15:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:15:33,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,249 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-07-25 13:15:33,250 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-07-25 13:15:33,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:33,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:33,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:15:33,491 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:15:33,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:15:33,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:15:33,492 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2018-07-25 13:15:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,667 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:15:33,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:15:33,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-07-25 13:15:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,668 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:15:33,668 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:15:33,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:15:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:15:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-07-25 13:15:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:15:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:15:33,690 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-07-25 13:15:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,690 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:15:33,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:15:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:15:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:15:33,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,692 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-07-25 13:15:33,692 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-07-25 13:15:33,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:34,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:15:34,013 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:15:34,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:15:34,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:15:34,014 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2018-07-25 13:15:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,225 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:15:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:15:34,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-07-25 13:15:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,226 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:15:34,226 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:15:34,227 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:15:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:15:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-07-25 13:15:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:15:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:15:34,256 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-07-25 13:15:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,257 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:15:34,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:15:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:15:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:15:34,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,258 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-07-25 13:15:34,258 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-07-25 13:15:34,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:34,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:15:34,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:15:34,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:15:34,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:34,517 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2018-07-25 13:15:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,728 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:15:34,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:15:34,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-07-25 13:15:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,730 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:15:34,730 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:15:34,732 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:15:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-07-25 13:15:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:15:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:15:34,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-07-25 13:15:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,758 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:15:34,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:15:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:15:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:15:34,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,759 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-07-25 13:15:34,760 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-07-25 13:15:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:35,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:15:35,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:15:35,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:15:35,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:15:35,033 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-07-25 13:15:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,254 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:15:35,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:15:35,254 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-07-25 13:15:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,255 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:15:35,255 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:15:35,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:15:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:15:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-07-25 13:15:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:15:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:15:35,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-07-25 13:15:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,287 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:15:35,287 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:15:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:15:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:15:35,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,288 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-07-25 13:15:35,288 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-07-25 13:15:35,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:35,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:15:35,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:15:35,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:15:35,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:15:35,537 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 21 states. [2018-07-25 13:15:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,779 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:15:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:15:35,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-07-25 13:15:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,780 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:15:35,780 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:15:35,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:15:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:15:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-07-25 13:15:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:15:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:15:35,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-07-25 13:15:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,817 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:15:35,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:15:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:15:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:15:35,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,818 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-07-25 13:15:35,819 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-07-25 13:15:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:36,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:15:36,091 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:15:36,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:15:36,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:15:36,092 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 22 states. [2018-07-25 13:15:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,351 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:15:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:15:36,351 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-07-25 13:15:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,352 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:15:36,352 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:15:36,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:15:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:15:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-07-25 13:15:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:15:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:15:36,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-07-25 13:15:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,384 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:15:36,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:15:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:15:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:15:36,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,385 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-07-25 13:15:36,385 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-07-25 13:15:36,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:36,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:15:36,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:15:36,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:15:36,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:15:36,647 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 23 states. [2018-07-25 13:15:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,922 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:15:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:15:36,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-07-25 13:15:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,923 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:15:36,923 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:15:36,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:15:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:15:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-07-25 13:15:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:15:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:15:36,958 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-07-25 13:15:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,958 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:15:36,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:15:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:15:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:15:36,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,960 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-07-25 13:15:36,960 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-07-25 13:15:36,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:37,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:37,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:15:37,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:15:37,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:15:37,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:15:37,262 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2018-07-25 13:15:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:37,661 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:15:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:15:37,661 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-07-25 13:15:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:37,663 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:15:37,663 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:15:37,664 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:15:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:15:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-07-25 13:15:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:15:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:15:37,705 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-07-25 13:15:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:37,705 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:15:37,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:15:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:15:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:15:37,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:37,706 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-07-25 13:15:37,707 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-07-25 13:15:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:38,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:38,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:15:38,047 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:15:38,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:15:38,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:15:38,048 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 25 states. [2018-07-25 13:15:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:38,375 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:15:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:15:38,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2018-07-25 13:15:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:38,376 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:15:38,376 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:15:38,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:15:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:15:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-07-25 13:15:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:15:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:15:38,422 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-07-25 13:15:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:38,422 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:15:38,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:15:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:15:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:15:38,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:38,429 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-07-25 13:15:38,430 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-07-25 13:15:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:38,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:38,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:15:38,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:15:38,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:15:38,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:15:38,740 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 26 states. [2018-07-25 13:15:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,078 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:15:39,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:15:39,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-07-25 13:15:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,079 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:15:39,079 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:15:39,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:15:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:15:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-07-25 13:15:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:15:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:15:39,120 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-07-25 13:15:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,121 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:15:39,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:15:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:15:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:15:39,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,122 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-07-25 13:15:39,122 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-07-25 13:15:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:39,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:39,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:15:39,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:15:39,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:15:39,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:15:39,442 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 27 states. [2018-07-25 13:15:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,798 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:15:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:15:39,798 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2018-07-25 13:15:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,799 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:15:39,799 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:15:39,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:15:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:15:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-07-25 13:15:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:15:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:15:39,842 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-07-25 13:15:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,842 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:15:39,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:15:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:15:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:15:39,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,843 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-07-25 13:15:39,843 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-07-25 13:15:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:40,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:40,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:15:40,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:15:40,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:15:40,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:15:40,174 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 28 states. [2018-07-25 13:15:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:40,606 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:15:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:15:40,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-07-25 13:15:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:40,607 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:15:40,607 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:15:40,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:15:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:15:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-07-25 13:15:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:15:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:15:40,661 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-07-25 13:15:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:40,662 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:15:40,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:15:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:15:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:15:40,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:40,663 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-07-25 13:15:40,663 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-07-25 13:15:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:41,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:41,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:15:41,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:15:41,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:15:41,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:15:41,067 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 29 states. [2018-07-25 13:15:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:41,443 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:15:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:15:41,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-07-25 13:15:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:41,444 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:15:41,444 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:15:41,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:15:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:15:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-07-25 13:15:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:15:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:15:41,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-07-25 13:15:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:41,489 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:15:41,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:15:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:15:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:15:41,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:41,490 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-07-25 13:15:41,490 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-07-25 13:15:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:41,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:41,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:15:41,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:15:41,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:15:41,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:15:41,828 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 30 states. [2018-07-25 13:15:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:42,261 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:15:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:15:42,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2018-07-25 13:15:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:42,262 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:15:42,262 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:15:42,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:15:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:15:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-07-25 13:15:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:15:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:15:42,320 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-07-25 13:15:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:42,320 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:15:42,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:15:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:15:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:15:42,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:42,321 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-07-25 13:15:42,321 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-07-25 13:15:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:42,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:42,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:15:42,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:15:42,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:15:42,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:15:42,675 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 31 states. [2018-07-25 13:15:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:43,107 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:15:43,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:15:43,107 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-07-25 13:15:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:43,108 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:15:43,108 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:15:43,109 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:15:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:15:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-07-25 13:15:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:15:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:15:43,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-07-25 13:15:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:43,167 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:15:43,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:15:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:15:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:15:43,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:43,168 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-07-25 13:15:43,172 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-07-25 13:15:43,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:43,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:43,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:15:43,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:15:43,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:15:43,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:15:43,560 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 32 states. [2018-07-25 13:15:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:44,014 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:15:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:15:44,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2018-07-25 13:15:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:44,015 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:15:44,015 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:15:44,016 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:15:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:15:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-07-25 13:15:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:15:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:15:44,070 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-07-25 13:15:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:44,070 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:15:44,070 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:15:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:15:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:15:44,071 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:44,071 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-07-25 13:15:44,071 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-07-25 13:15:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:44,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:44,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:15:44,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:15:44,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:15:44,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:15:44,508 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 33 states. [2018-07-25 13:15:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:45,037 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:15:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:15:45,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-07-25 13:15:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:45,039 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:15:45,039 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:15:45,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:15:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:15:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-07-25 13:15:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:15:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:15:45,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-07-25 13:15:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:45,100 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:15:45,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:15:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:15:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:15:45,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:45,101 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-07-25 13:15:45,101 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-07-25 13:15:45,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:45,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:45,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:15:45,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:15:45,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:15:45,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:15:45,462 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 34 states. [2018-07-25 13:15:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:45,924 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:15:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:15:45,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2018-07-25 13:15:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:45,925 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:15:45,925 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:15:45,926 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:15:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:15:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-07-25 13:15:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:15:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:15:45,980 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-07-25 13:15:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:45,980 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:15:45,981 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:15:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:15:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:15:45,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:45,981 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-07-25 13:15:45,982 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:45,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-07-25 13:15:45,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:46,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:46,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:15:46,361 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:15:46,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:15:46,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:15:46,363 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 35 states. [2018-07-25 13:15:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:46,869 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:15:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:15:46,869 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-07-25 13:15:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:46,870 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:15:46,870 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:15:46,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:15:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:15:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-07-25 13:15:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:15:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:15:46,927 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-07-25 13:15:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:46,927 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:15:46,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:15:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:15:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:15:46,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:46,928 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-07-25 13:15:46,928 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-07-25 13:15:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:47,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:47,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:15:47,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:15:47,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:15:47,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:15:47,342 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 36 states. [2018-07-25 13:15:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:47,875 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:15:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:15:47,876 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-07-25 13:15:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:47,876 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:15:47,876 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:15:47,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:15:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:15:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-07-25 13:15:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:15:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:15:47,942 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-07-25 13:15:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:47,942 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:15:47,942 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:15:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:15:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:15:47,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:47,943 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-07-25 13:15:47,943 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-07-25 13:15:47,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:48,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:48,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:15:48,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:15:48,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:15:48,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:15:48,395 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 37 states. [2018-07-25 13:15:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:48,941 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:15:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:15:48,941 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 67 [2018-07-25 13:15:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:48,942 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:15:48,942 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:15:48,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:15:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:15:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-07-25 13:15:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:15:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:15:49,007 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-07-25 13:15:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:49,007 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:15:49,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:15:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:15:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:15:49,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:49,009 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-07-25 13:15:49,010 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-07-25 13:15:49,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:49,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:49,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:15:49,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:15:49,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:15:49,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:15:49,454 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 38 states. [2018-07-25 13:15:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:50,017 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:15:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:15:50,018 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2018-07-25 13:15:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:50,019 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:15:50,019 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:15:50,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:15:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:15:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-07-25 13:15:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:15:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:15:50,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-07-25 13:15:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:50,087 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:15:50,087 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:15:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:15:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:15:50,088 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:50,088 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-07-25 13:15:50,088 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-07-25 13:15:50,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:50,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:50,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:15:50,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:15:50,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:15:50,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:15:50,528 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 39 states. [2018-07-25 13:15:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:51,109 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:15:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:15:51,110 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 71 [2018-07-25 13:15:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:51,111 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:15:51,111 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:15:51,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:15:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:15:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-07-25 13:15:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:15:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:15:51,182 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-07-25 13:15:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:51,182 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:15:51,182 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:15:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:15:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:15:51,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:51,183 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-07-25 13:15:51,183 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-07-25 13:15:51,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:51,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:51,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:15:51,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:15:51,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:15:51,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:15:51,685 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 40 states. [2018-07-25 13:15:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:52,317 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:15:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:15:52,317 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2018-07-25 13:15:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:52,318 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:15:52,318 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:15:52,319 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:15:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:15:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-07-25 13:15:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:15:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:15:52,391 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-07-25 13:15:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:52,391 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:15:52,391 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:15:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:15:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:15:52,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:52,392 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-07-25 13:15:52,393 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-07-25 13:15:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:52,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:52,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:15:52,856 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:15:52,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:15:52,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:15:52,857 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 41 states. [2018-07-25 13:15:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:53,462 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:15:53,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:15:53,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 75 [2018-07-25 13:15:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:53,463 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:15:53,463 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:15:53,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:15:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:15:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-07-25 13:15:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:15:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:15:53,530 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-07-25 13:15:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:53,530 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:15:53,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:15:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:15:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:15:53,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:53,531 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-07-25 13:15:53,531 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-07-25 13:15:53,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:53,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:53,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:15:53,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:15:53,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:15:53,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:15:53,973 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 42 states. [2018-07-25 13:15:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:54,569 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:15:54,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:15:54,569 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 77 [2018-07-25 13:15:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:54,570 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:15:54,570 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:15:54,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:15:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:15:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-07-25 13:15:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:15:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:15:54,640 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-07-25 13:15:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:54,640 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:15:54,640 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:15:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:15:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:15:54,641 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:54,641 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-07-25 13:15:54,641 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-07-25 13:15:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:55,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:55,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:15:55,147 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:15:55,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:15:55,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:15:55,148 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 43 states. [2018-07-25 13:15:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:55,745 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:15:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:15:55,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 79 [2018-07-25 13:15:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:55,746 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:15:55,746 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:15:55,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:15:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:15:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-07-25 13:15:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:15:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:15:55,811 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-07-25 13:15:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:55,812 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:15:55,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:15:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:15:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:15:55,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:55,813 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-07-25 13:15:55,813 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-07-25 13:15:55,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:56,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:56,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:15:56,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:15:56,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:15:56,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:15:56,292 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 44 states. [2018-07-25 13:15:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:56,830 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:15:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:15:56,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2018-07-25 13:15:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:56,832 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:15:56,832 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:15:56,833 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:15:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:15:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-07-25 13:15:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:15:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:15:56,887 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-07-25 13:15:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:56,887 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:15:56,887 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:15:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:15:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:15:56,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:56,888 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-07-25 13:15:56,889 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-07-25 13:15:56,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:57,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:57,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:15:57,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:15:57,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:15:57,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:15:57,344 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 45 states. [2018-07-25 13:15:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:57,873 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:15:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:15:57,873 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 83 [2018-07-25 13:15:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:57,874 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:15:57,874 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:15:57,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:15:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:15:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-07-25 13:15:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:15:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:15:57,934 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-07-25 13:15:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:57,934 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:15:57,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:15:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:15:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:15:57,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:57,935 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-07-25 13:15:57,935 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-07-25 13:15:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:58,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:58,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:15:58,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:15:58,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:15:58,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:15:58,589 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 46 states. [2018-07-25 13:15:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,122 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:15:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:15:59,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-07-25 13:15:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,123 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:15:59,123 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:15:59,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:15:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:15:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-07-25 13:15:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:15:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:15:59,187 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-07-25 13:15:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:59,187 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:15:59,187 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:15:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:15:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:15:59,188 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:59,189 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-07-25 13:15:59,189 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-07-25 13:15:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:59,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:59,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:15:59,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:15:59,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:15:59,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:15:59,671 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 47 states. [2018-07-25 13:16:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,440 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:16:00,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:16:00,440 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2018-07-25 13:16:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,441 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:16:00,441 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:16:00,442 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:16:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:16:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-07-25 13:16:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:16:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:16:00,534 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-07-25 13:16:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,535 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:16:00,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:16:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:16:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:16:00,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,536 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-07-25 13:16:00,536 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-07-25 13:16:00,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:00,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:16:00,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:16:00,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:16:00,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:16:00,999 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 48 states. [2018-07-25 13:16:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,844 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:16:01,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:16:01,845 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 89 [2018-07-25 13:16:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,846 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:16:01,846 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:16:01,847 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:16:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:16:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-07-25 13:16:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:16:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:16:01,951 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-07-25 13:16:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,951 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:16:01,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:16:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:16:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:16:01,952 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,952 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-07-25 13:16:01,953 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-07-25 13:16:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:02,467 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:02,467 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:16:02,467 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:16:02,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:16:02,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:16:02,468 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 49 states. [2018-07-25 13:16:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,210 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:16:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:16:03,211 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 91 [2018-07-25 13:16:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,212 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:16:03,212 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:16:03,212 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:16:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:16:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-07-25 13:16:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:16:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:16:03,309 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-07-25 13:16:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,309 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:16:03,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:16:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:16:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:16:03,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,310 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-07-25 13:16:03,311 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-07-25 13:16:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:16:03,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:16:03,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:16:03,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:16:03,788 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 50 states. [2018-07-25 13:16:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,397 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:16:04,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:16:04,397 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2018-07-25 13:16:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,398 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:16:04,398 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:16:04,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:16:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:16:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-07-25 13:16:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:16:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:16:04,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-07-25 13:16:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:04,490 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:16:04,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:16:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:16:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:16:04,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:04,491 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-07-25 13:16:04,491 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-07-25 13:16:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:04,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:04,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:16:04,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:16:04,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:16:04,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:16:04,963 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 51 states. [2018-07-25 13:16:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:05,708 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:16:05,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:16:05,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 95 [2018-07-25 13:16:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:05,709 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:16:05,709 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:16:05,710 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:16:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:16:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-07-25 13:16:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:16:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:16:05,799 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-07-25 13:16:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,799 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:16:05,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:16:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:16:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:16:05,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,800 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-07-25 13:16:05,800 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-07-25 13:16:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:06,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:16:06,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:16:06,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:16:06,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:16:06,262 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 52 states. [2018-07-25 13:16:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:06,882 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:16:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:16:06,883 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2018-07-25 13:16:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:06,883 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:16:06,883 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:16:06,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:16:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:16:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-07-25 13:16:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:16:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:16:06,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-07-25 13:16:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:06,954 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:16:06,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:16:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:16:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:16:06,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:06,955 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-07-25 13:16:06,955 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-07-25 13:16:06,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:07,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:07,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:16:07,413 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:16:07,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:16:07,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:16:07,413 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 53 states. [2018-07-25 13:16:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:08,068 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:16:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:16:08,069 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2018-07-25 13:16:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:08,069 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:16:08,070 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:16:08,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:16:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:16:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-07-25 13:16:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:16:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:16:08,141 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-07-25 13:16:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:08,141 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:16:08,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:16:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:16:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:16:08,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:08,142 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-07-25 13:16:08,142 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-07-25 13:16:08,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:08,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:08,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:16:08,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:16:08,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:16:08,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:16:08,726 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 54 states. [2018-07-25 13:16:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:09,602 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:16:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:16:09,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 101 [2018-07-25 13:16:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:09,604 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:16:09,604 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:16:09,605 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:16:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:16:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-07-25 13:16:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:16:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:16:09,684 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-07-25 13:16:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:09,684 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:16:09,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:16:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:16:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:16:09,685 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:09,685 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-07-25 13:16:09,686 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-07-25 13:16:09,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:10,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:10,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:16:10,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:16:10,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:16:10,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:16:10,192 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 55 states. [2018-07-25 13:16:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:10,913 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:16:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:16:10,913 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2018-07-25 13:16:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:10,914 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:16:10,914 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:16:10,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:16:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:16:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-07-25 13:16:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:16:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:16:11,021 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-07-25 13:16:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:11,022 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:16:11,022 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:16:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:16:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:16:11,023 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:11,023 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-07-25 13:16:11,023 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-07-25 13:16:11,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:11,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:11,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:16:11,604 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:16:11,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:16:11,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:16:11,606 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 56 states. [2018-07-25 13:16:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,389 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:16:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:16:12,389 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 105 [2018-07-25 13:16:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,390 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:16:12,390 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:16:12,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:16:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:16:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-07-25 13:16:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:16:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:16:12,480 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-07-25 13:16:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,481 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:16:12,481 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:16:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:16:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:16:12,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,482 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-07-25 13:16:12,482 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-07-25 13:16:12,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:12,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:16:12,957 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:16:12,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:16:12,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:16:12,957 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 57 states. [2018-07-25 13:16:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,676 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:16:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:16:13,676 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 107 [2018-07-25 13:16:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,677 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:16:13,677 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:16:13,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:16:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:16:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-07-25 13:16:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:16:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:16:13,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-07-25 13:16:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,757 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:16:13,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:16:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:16:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:16:13,757 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,757 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-07-25 13:16:13,758 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-07-25 13:16:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:14,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:16:14,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:16:14,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:16:14,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:16:14,369 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 58 states. [2018-07-25 13:16:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:15,128 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:16:15,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:16:15,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2018-07-25 13:16:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:15,129 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:16:15,129 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:16:15,129 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:16:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:16:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-07-25 13:16:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:16:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:16:15,208 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-07-25 13:16:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,208 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:16:15,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:16:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:16:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:16:15,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,209 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-07-25 13:16:15,209 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-07-25 13:16:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:16:15,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:16:15,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:16:15,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:16:15,691 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 59 states. [2018-07-25 13:16:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,466 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:16:16,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:16:16,467 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 111 [2018-07-25 13:16:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,468 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:16:16,468 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:16:16,468 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:16:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:16:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-07-25 13:16:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:16:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:16:16,558 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-07-25 13:16:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,558 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:16:16,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:16:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:16:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:16:16,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,559 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-07-25 13:16:16,559 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-07-25 13:16:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:16:17,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:16:17,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:16:17,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:16:17,374 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 60 states. [2018-07-25 13:16:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:18,264 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:16:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:16:18,264 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 113 [2018-07-25 13:16:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:18,265 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:16:18,265 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:16:18,266 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:16:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:16:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-07-25 13:16:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:16:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:16:18,404 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-07-25 13:16:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:18,405 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:16:18,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:16:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:16:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:16:18,405 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:18,405 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-07-25 13:16:18,406 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-07-25 13:16:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:18,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:18,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:16:18,952 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:16:18,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:16:18,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:16:18,953 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 61 states. [2018-07-25 13:16:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,752 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:16:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:16:19,752 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 115 [2018-07-25 13:16:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,753 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:16:19,753 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:16:19,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:16:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:16:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-07-25 13:16:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:16:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:16:19,846 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-07-25 13:16:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,846 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:16:19,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:16:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:16:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:16:19,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,847 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-07-25 13:16:19,848 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-07-25 13:16:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:20,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:20,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:16:20,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:16:20,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:16:20,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:16:20,439 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 62 states. [2018-07-25 13:16:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,305 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:16:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:16:21,305 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 117 [2018-07-25 13:16:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,306 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:16:21,306 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:16:21,306 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:16:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:16:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-07-25 13:16:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:16:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:16:21,398 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-07-25 13:16:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,398 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:16:21,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:16:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:16:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:16:21,399 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,399 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-07-25 13:16:21,399 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-07-25 13:16:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:21,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:21,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:16:21,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:16:21,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:16:21,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:16:21,980 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 63 states. [2018-07-25 13:16:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:22,844 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:16:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:16:22,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 119 [2018-07-25 13:16:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:22,845 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:16:22,845 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:16:22,846 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:16:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:16:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-07-25 13:16:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:16:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:16:22,944 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-07-25 13:16:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:22,944 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:16:22,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:16:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:16:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:16:22,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:22,945 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-07-25 13:16:22,945 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-07-25 13:16:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:23,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:23,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:16:23,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:16:23,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:16:23,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:16:23,520 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 64 states. [2018-07-25 13:16:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:24,427 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:16:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:16:24,427 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 121 [2018-07-25 13:16:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:24,428 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:16:24,428 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:16:24,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:16:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:16:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-07-25 13:16:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:16:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:16:24,537 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-07-25 13:16:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:24,537 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:16:24,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:16:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:16:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:16:24,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:24,538 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-07-25 13:16:24,538 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-07-25 13:16:24,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:25,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:25,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:16:25,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:16:25,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:16:25,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:16:25,245 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 65 states. [2018-07-25 13:16:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,179 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:16:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:16:26,179 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 123 [2018-07-25 13:16:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,180 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:16:26,180 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:16:26,180 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:16:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:16:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-07-25 13:16:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:16:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:16:26,285 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-07-25 13:16:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:26,286 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:16:26,286 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:16:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:16:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:16:26,286 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:26,286 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-07-25 13:16:26,287 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-07-25 13:16:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:26,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:26,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:16:26,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:16:26,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:16:26,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:16:26,943 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 66 states. [2018-07-25 13:16:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:28,050 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:16:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:16:28,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 125 [2018-07-25 13:16:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:28,052 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:16:28,052 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:16:28,052 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:16:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:16:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-07-25 13:16:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:16:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:16:28,180 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-07-25 13:16:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:28,181 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:16:28,181 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:16:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:16:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:16:28,182 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:28,182 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-07-25 13:16:28,182 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-07-25 13:16:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:28,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:28,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:16:28,865 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:16:28,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:16:28,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:16:28,866 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 67 states. [2018-07-25 13:16:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,808 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:16:29,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:16:29,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 127 [2018-07-25 13:16:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,809 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:16:29,809 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:16:29,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:16:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:16:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-07-25 13:16:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:16:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:16:29,944 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-07-25 13:16:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:29,945 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:16:29,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:16:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:16:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:16:29,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:29,945 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-07-25 13:16:29,946 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-07-25 13:16:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:30,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:30,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:16:30,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:16:30,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:16:30,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:16:30,625 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 68 states. [2018-07-25 13:16:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:31,673 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:16:31,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:16:31,673 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 129 [2018-07-25 13:16:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:31,674 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:16:31,674 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:16:31,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:16:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:16:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-07-25 13:16:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:16:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:16:31,803 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-07-25 13:16:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:31,804 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:16:31,804 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:16:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:16:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:16:31,806 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:31,806 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-07-25 13:16:31,806 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-07-25 13:16:31,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:32,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:32,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:16:32,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:16:32,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:16:32,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:16:32,554 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 69 states. [2018-07-25 13:16:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:33,600 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:16:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:16:33,600 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 131 [2018-07-25 13:16:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:33,601 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:16:33,601 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:16:33,601 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:16:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:16:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-07-25 13:16:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:16:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:16:33,729 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-07-25 13:16:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:33,729 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:16:33,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:16:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:16:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:16:33,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:33,730 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-07-25 13:16:33,730 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:33,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-07-25 13:16:33,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:34,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:34,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:16:34,562 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:16:34,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:16:34,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:16:34,562 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 70 states. [2018-07-25 13:16:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:35,710 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:16:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:16:35,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 133 [2018-07-25 13:16:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:35,712 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:16:35,712 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:16:35,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:16:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:16:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-07-25 13:16:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:16:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:16:35,869 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-07-25 13:16:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:35,870 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:16:35,870 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:16:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:16:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:16:35,870 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:35,870 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-07-25 13:16:35,871 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-07-25 13:16:35,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:36,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:36,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:16:36,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:16:36,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:16:36,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:16:36,717 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 71 states. [2018-07-25 13:16:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:37,963 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:16:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:16:37,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 135 [2018-07-25 13:16:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:37,964 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:16:37,965 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:16:37,965 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:16:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:16:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-07-25 13:16:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:16:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:16:38,103 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-07-25 13:16:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:38,103 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:16:38,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:16:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:16:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:16:38,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:38,104 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-07-25 13:16:38,104 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-07-25 13:16:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:38,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:38,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:16:38,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:16:38,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:16:38,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:16:38,864 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 72 states. [2018-07-25 13:16:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:40,022 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:16:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:16:40,022 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 137 [2018-07-25 13:16:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:40,024 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:16:40,024 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:16:40,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:16:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:16:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-07-25 13:16:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:16:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:16:40,238 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-07-25 13:16:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:40,239 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:16:40,239 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:16:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:16:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:16:40,240 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:40,240 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-07-25 13:16:40,240 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-07-25 13:16:40,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:41,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:41,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:16:41,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:16:41,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:16:41,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:16:41,040 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 73 states. [2018-07-25 13:16:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:42,359 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:16:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:16:42,360 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 139 [2018-07-25 13:16:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:42,360 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:16:42,360 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:16:42,361 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:16:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:16:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-07-25 13:16:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:16:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:16:42,494 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-07-25 13:16:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,494 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:16:42,494 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:16:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:16:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:16:42,495 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,495 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-07-25 13:16:42,495 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-07-25 13:16:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:16:43,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:16:43,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:16:43,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:16:43,289 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 74 states. [2018-07-25 13:16:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,612 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:16:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:16:44,612 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 141 [2018-07-25 13:16:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,613 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:16:44,613 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:16:44,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:16:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:16:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-07-25 13:16:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:16:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:16:44,762 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-07-25 13:16:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,762 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:16:44,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:16:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:16:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:16:44,763 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,763 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-07-25 13:16:44,763 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-07-25 13:16:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:16:45,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:16:45,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:16:45,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:16:45,622 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 75 states. [2018-07-25 13:16:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,980 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:16:46,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:16:46,980 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 143 [2018-07-25 13:16:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,981 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:16:46,981 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:16:46,982 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:16:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:16:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-07-25 13:16:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:16:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:16:47,150 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-07-25 13:16:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,150 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:16:47,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:16:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:16:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:16:47,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,151 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-07-25 13:16:47,151 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-07-25 13:16:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:16:47,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:16:47,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:16:47,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:16:47,992 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 76 states. [2018-07-25 13:16:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,597 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:16:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:16:49,597 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-07-25 13:16:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,598 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:16:49,598 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:16:49,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:16:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:16:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-07-25 13:16:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:16:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:16:49,769 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-07-25 13:16:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:49,769 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:16:49,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:16:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:16:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:16:49,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:49,770 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-07-25 13:16:49,770 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-07-25 13:16:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:16:50,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:16:50,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:16:50,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:16:50,661 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 77 states. [2018-07-25 13:16:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,100 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:16:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:16:52,100 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 147 [2018-07-25 13:16:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,101 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:16:52,101 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:16:52,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:16:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:16:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-07-25 13:16:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:16:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:16:52,272 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-07-25 13:16:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,272 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:16:52,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:16:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:16:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:16:52,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,273 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-07-25 13:16:52,273 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-07-25 13:16:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:53,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:16:53,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:16:53,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:16:53,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:16:53,236 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 78 states. [2018-07-25 13:16:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,569 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:16:54,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:16:54,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 149 [2018-07-25 13:16:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,570 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:16:54,570 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:16:54,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:16:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:16:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-07-25 13:16:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:16:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:16:54,814 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-07-25 13:16:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,815 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:16:54,815 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:16:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:16:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:16:54,816 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,816 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-07-25 13:16:54,817 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-07-25 13:16:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:55,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:16:55,738 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:16:55,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:16:55,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:16:55,739 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 79 states. [2018-07-25 13:16:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,197 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 13:16:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:16:57,198 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-07-25 13:16:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,199 INFO L225 Difference]: With dead ends: 156 [2018-07-25 13:16:57,199 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:16:57,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:16:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:16:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-07-25 13:16:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 13:16:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 13:16:57,366 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-07-25 13:16:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:57,366 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 13:16:57,366 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:16:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 13:16:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 13:16:57,367 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:57,367 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-07-25 13:16:57,367 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-07-25 13:16:57,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:16:58,355 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:16:58,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:16:58,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:16:58,355 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 80 states. [2018-07-25 13:16:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:59,836 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 13:16:59,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:16:59,836 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 153 [2018-07-25 13:16:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:59,837 INFO L225 Difference]: With dead ends: 158 [2018-07-25 13:16:59,838 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:16:59,838 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:16:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:17:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-07-25 13:17:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:17:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:17:00,010 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-07-25 13:17:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,010 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:17:00,010 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:17:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:17:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:17:00,011 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,011 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-07-25 13:17:00,011 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-07-25 13:17:00,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,008 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,008 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:17:01,008 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:17:01,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:17:01,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:17:01,009 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 81 states. [2018-07-25 13:17:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,593 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:17:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:17:02,593 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 155 [2018-07-25 13:17:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,594 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:17:02,594 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:17:02,594 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:17:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:17:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-07-25 13:17:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 13:17:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 13:17:02,770 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-07-25 13:17:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,770 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 13:17:02,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:17:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 13:17:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 13:17:02,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,771 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-07-25 13:17:02,772 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-07-25 13:17:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:03,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:03,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:17:03,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:17:03,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:17:03,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:17:03,899 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 82 states. [2018-07-25 13:17:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,559 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 13:17:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:17:05,559 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 157 [2018-07-25 13:17:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,560 INFO L225 Difference]: With dead ends: 162 [2018-07-25 13:17:05,560 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:17:05,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:17:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:17:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-07-25 13:17:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:17:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 13:17:05,737 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-07-25 13:17:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,738 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 13:17:05,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:17:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 13:17:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 13:17:05,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,739 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-07-25 13:17:05,739 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-07-25 13:17:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:06,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:17:06,791 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:17:06,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:17:06,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:17:06,792 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 83 states. [2018-07-25 13:17:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:08,357 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 13:17:08,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:17:08,357 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 159 [2018-07-25 13:17:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:08,358 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:17:08,358 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:17:08,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:17:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:17:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-07-25 13:17:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 13:17:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 13:17:08,519 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-07-25 13:17:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,519 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 13:17:08,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:17:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 13:17:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 13:17:08,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,520 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-07-25 13:17:08,521 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-07-25 13:17:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:09,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:09,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:17:09,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:17:09,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:17:09,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:17:09,426 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 84 states. [2018-07-25 13:17:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:11,003 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 13:17:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:17:11,003 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 161 [2018-07-25 13:17:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:11,004 INFO L225 Difference]: With dead ends: 166 [2018-07-25 13:17:11,004 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:17:11,005 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:17:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:17:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-07-25 13:17:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 13:17:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 13:17:11,189 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-07-25 13:17:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:11,190 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 13:17:11,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:17:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 13:17:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 13:17:11,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:11,191 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-07-25 13:17:11,191 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-07-25 13:17:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:12,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:12,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:17:12,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:17:12,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:17:12,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:17:12,230 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 85 states. [2018-07-25 13:17:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:13,815 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 13:17:13,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:17:13,815 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-07-25 13:17:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:13,816 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:17:13,816 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:17:13,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:17:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:17:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-07-25 13:17:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:17:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:17:14,005 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-07-25 13:17:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:14,005 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:17:14,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:17:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:17:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:17:14,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:14,006 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-07-25 13:17:14,006 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-07-25 13:17:14,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:15,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:15,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:17:15,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:17:15,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:17:15,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:17:15,119 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 86 states. [2018-07-25 13:17:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,935 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:17:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:17:16,935 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 165 [2018-07-25 13:17:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,936 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:17:16,936 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:17:16,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:17:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:17:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-07-25 13:17:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:17:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 13:17:17,137 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-07-25 13:17:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:17,137 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 13:17:17,137 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:17:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 13:17:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 13:17:17,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:17,138 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-07-25 13:17:17,138 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:17,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-07-25 13:17:17,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:18,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:18,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:17:18,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:17:18,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:17:18,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:17:18,324 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 87 states. [2018-07-25 13:17:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:20,194 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 13:17:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:17:20,195 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 167 [2018-07-25 13:17:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:20,195 INFO L225 Difference]: With dead ends: 172 [2018-07-25 13:17:20,196 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:17:20,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:17:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:17:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-07-25 13:17:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 13:17:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 13:17:20,407 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-07-25 13:17:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:20,408 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 13:17:20,408 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:17:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 13:17:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 13:17:20,409 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:20,409 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-07-25 13:17:20,409 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-07-25 13:17:20,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:17:21,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:17:21,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:17:21,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:17:21,501 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 88 states. [2018-07-25 13:17:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:23,309 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 13:17:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:17:23,310 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-07-25 13:17:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:23,311 INFO L225 Difference]: With dead ends: 174 [2018-07-25 13:17:23,311 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:17:23,311 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:17:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:17:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-07-25 13:17:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 13:17:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 13:17:23,505 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-07-25 13:17:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:23,505 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 13:17:23,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:17:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 13:17:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 13:17:23,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:23,506 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-07-25 13:17:23,507 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-07-25 13:17:23,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:24,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:24,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:17:24,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:17:24,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:17:24,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:17:24,675 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 89 states. [2018-07-25 13:17:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:26,648 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 13:17:26,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:17:26,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 171 [2018-07-25 13:17:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:26,649 INFO L225 Difference]: With dead ends: 176 [2018-07-25 13:17:26,649 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:17:26,649 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:17:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:17:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-07-25 13:17:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:17:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 13:17:26,841 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-07-25 13:17:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:26,841 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 13:17:26,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:17:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 13:17:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 13:17:26,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:26,842 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-07-25 13:17:26,843 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-07-25 13:17:26,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:27,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:27,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:17:27,908 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:17:27,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:17:27,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:17:27,909 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 90 states. [2018-07-25 13:17:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:29,670 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 13:17:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:17:29,671 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 173 [2018-07-25 13:17:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:29,672 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:17:29,672 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:17:29,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:17:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:17:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-07-25 13:17:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:17:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:17:29,860 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-07-25 13:17:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:29,860 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:17:29,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:17:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:17:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:17:29,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:29,861 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-07-25 13:17:29,862 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-07-25 13:17:29,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:30,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:30,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:17:30,970 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:17:30,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:17:30,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:17:30,971 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 91 states. [2018-07-25 13:17:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:32,745 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:17:32,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:17:32,745 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 175 [2018-07-25 13:17:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:32,746 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:17:32,746 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:17:32,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:17:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:17:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-07-25 13:17:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 13:17:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 13:17:32,964 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-07-25 13:17:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:32,964 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 13:17:32,965 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:17:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 13:17:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 13:17:32,965 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:32,965 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-07-25 13:17:32,965 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-07-25 13:17:32,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:34,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:34,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:17:34,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:17:34,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:17:34,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:17:34,273 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 92 states. [2018-07-25 13:17:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:36,278 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 13:17:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:17:36,279 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 177 [2018-07-25 13:17:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:36,280 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:17:36,280 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:17:36,280 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:17:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:17:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-07-25 13:17:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:17:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 13:17:36,505 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-07-25 13:17:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:36,505 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 13:17:36,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:17:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 13:17:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 13:17:36,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:36,506 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-07-25 13:17:36,506 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-07-25 13:17:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:37,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:37,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:17:37,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:17:37,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:17:37,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:17:37,666 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 93 states. [2018-07-25 13:17:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:39,592 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 13:17:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:17:39,592 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 179 [2018-07-25 13:17:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:39,593 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:17:39,593 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:17:39,594 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:17:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:17:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-07-25 13:17:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:17:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 13:17:39,825 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-07-25 13:17:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:39,825 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 13:17:39,825 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:17:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 13:17:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 13:17:39,826 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:39,827 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-07-25 13:17:39,827 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-07-25 13:17:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:41,078 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:41,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:17:41,079 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:17:41,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:17:41,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:17:41,079 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 94 states. [2018-07-25 13:17:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:43,086 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 13:17:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:17:43,086 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-07-25 13:17:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:43,088 INFO L225 Difference]: With dead ends: 186 [2018-07-25 13:17:43,088 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:17:43,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:17:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:17:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-07-25 13:17:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:17:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 13:17:43,304 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-07-25 13:17:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:43,304 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 13:17:43,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:17:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 13:17:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:17:43,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:43,305 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-07-25 13:17:43,305 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-07-25 13:17:43,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:44,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:44,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:17:44,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:17:44,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:17:44,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:17:44,586 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 95 states. [2018-07-25 13:17:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:46,627 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 13:17:46,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:17:46,627 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 183 [2018-07-25 13:17:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:46,628 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:17:46,628 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:17:46,628 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:17:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:17:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-07-25 13:17:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:17:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:17:46,839 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-07-25 13:17:46,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,839 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:17:46,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:17:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:17:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:17:46,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,840 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-07-25 13:17:46,840 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-07-25 13:17:46,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:48,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:48,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:17:48,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:17:48,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:17:48,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:17:48,124 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 96 states. [2018-07-25 13:17:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:50,431 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:17:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:17:50,431 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 185 [2018-07-25 13:17:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:50,432 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:17:50,432 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:17:50,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:17:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:17:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-07-25 13:17:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 13:17:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 13:17:50,676 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-07-25 13:17:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:50,676 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 13:17:50,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:17:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 13:17:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 13:17:50,677 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:50,677 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-07-25 13:17:50,677 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-07-25 13:17:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:52,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:52,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:17:52,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:17:52,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:17:52,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:17:52,114 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 97 states. [2018-07-25 13:17:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:54,375 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 13:17:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:17:54,375 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-07-25 13:17:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:54,376 INFO L225 Difference]: With dead ends: 192 [2018-07-25 13:17:54,376 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:17:54,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:17:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:17:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-07-25 13:17:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 13:17:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 13:17:54,627 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-07-25 13:17:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:54,628 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 13:17:54,628 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:17:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 13:17:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 13:17:54,629 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:54,629 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-07-25 13:17:54,629 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-07-25 13:17:54,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:56,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:56,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:17:56,006 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:17:56,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:17:56,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:17:56,007 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 98 states. [2018-07-25 13:17:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:58,421 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 13:17:58,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:17:58,421 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 189 [2018-07-25 13:17:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:58,422 INFO L225 Difference]: With dead ends: 194 [2018-07-25 13:17:58,422 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:17:58,423 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:17:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:17:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-07-25 13:17:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 13:17:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 13:17:58,691 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-07-25 13:17:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:58,691 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 13:17:58,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:17:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 13:17:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 13:17:58,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:58,692 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-07-25 13:17:58,693 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-07-25 13:17:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:00,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:00,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:18:00,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:18:00,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:18:00,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:18:00,212 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 99 states. [2018-07-25 13:18:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:02,476 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 13:18:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:18:02,477 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 191 [2018-07-25 13:18:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:02,477 INFO L225 Difference]: With dead ends: 196 [2018-07-25 13:18:02,477 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:18:02,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:18:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:18:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-07-25 13:18:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 13:18:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 13:18:02,704 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-07-25 13:18:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:02,705 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 13:18:02,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:18:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 13:18:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 13:18:02,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:02,706 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-07-25 13:18:02,706 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-07-25 13:18:02,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:04,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:04,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:18:04,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:18:04,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:18:04,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:18:04,161 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 100 states. [2018-07-25 13:18:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:06,482 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 13:18:06,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:18:06,482 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 193 [2018-07-25 13:18:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:06,483 INFO L225 Difference]: With dead ends: 198 [2018-07-25 13:18:06,483 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:18:06,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:18:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:18:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-07-25 13:18:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:18:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 13:18:06,748 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-07-25 13:18:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:06,748 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 13:18:06,748 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:18:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 13:18:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 13:18:06,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:06,749 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-07-25 13:18:06,749 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-07-25 13:18:06,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:08,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:08,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:18:08,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:18:08,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:18:08,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:18:08,371 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 101 states. [2018-07-25 13:18:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:10,908 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 13:18:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:18:10,908 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 195 [2018-07-25 13:18:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:10,909 INFO L225 Difference]: With dead ends: 200 [2018-07-25 13:18:10,909 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:18:10,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:18:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:18:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-07-25 13:18:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 13:18:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 13:18:11,180 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-07-25 13:18:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:11,180 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 13:18:11,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:18:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 13:18:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 13:18:11,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:11,181 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-07-25 13:18:11,181 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-07-25 13:18:11,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:12,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:12,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:18:12,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:18:12,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:18:12,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:18:12,711 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 102 states. [2018-07-25 13:18:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:15,207 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-25 13:18:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:18:15,207 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 197 [2018-07-25 13:18:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:15,208 INFO L225 Difference]: With dead ends: 202 [2018-07-25 13:18:15,208 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:18:15,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:18:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:18:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-07-25 13:18:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 13:18:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-25 13:18:15,463 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-07-25 13:18:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:15,463 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-25 13:18:15,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:18:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-25 13:18:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-25 13:18:15,464 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:15,464 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-07-25 13:18:15,464 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-07-25 13:18:15,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:17,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:17,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:18:17,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:18:17,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:18:17,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:18:17,169 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 103 states. [2018-07-25 13:18:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:19,658 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-25 13:18:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:18:19,658 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 199 [2018-07-25 13:18:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:19,659 INFO L225 Difference]: With dead ends: 204 [2018-07-25 13:18:19,659 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:18:19,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:18:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:18:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-07-25 13:18:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-25 13:18:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-25 13:18:19,940 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2018-07-25 13:18:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:19,941 INFO L472 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-25 13:18:19,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:18:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-25 13:18:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-25 13:18:19,942 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:19,942 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2018-07-25 13:18:19,942 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2018-07-25 13:18:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:21,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:21,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:18:21,621 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:18:21,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:18:21,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:18:21,622 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 104 states. [2018-07-25 13:18:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:24,153 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-25 13:18:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:18:24,153 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 201 [2018-07-25 13:18:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:24,154 INFO L225 Difference]: With dead ends: 206 [2018-07-25 13:18:24,154 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:18:24,154 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:18:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:18:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-07-25 13:18:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-25 13:18:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-25 13:18:24,441 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2018-07-25 13:18:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:24,441 INFO L472 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-25 13:18:24,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:18:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-25 13:18:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-25 13:18:24,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:24,442 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2018-07-25 13:18:24,442 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2018-07-25 13:18:24,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:26,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:26,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:18:26,179 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:18:26,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:18:26,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:18:26,180 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 105 states. [2018-07-25 13:18:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:28,826 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-25 13:18:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:18:28,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 203 [2018-07-25 13:18:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:28,827 INFO L225 Difference]: With dead ends: 208 [2018-07-25 13:18:28,827 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:18:28,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:18:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:18:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-07-25 13:18:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:18:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 13:18:29,122 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2018-07-25 13:18:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:29,122 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 13:18:29,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:18:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 13:18:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 13:18:29,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:29,123 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2018-07-25 13:18:29,124 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2018-07-25 13:18:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:30,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:30,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:18:30,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:18:30,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:18:30,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:18:30,759 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 106 states. [2018-07-25 13:18:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:33,502 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 13:18:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:18:33,502 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 205 [2018-07-25 13:18:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:33,503 INFO L225 Difference]: With dead ends: 210 [2018-07-25 13:18:33,503 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:18:33,504 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:18:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:18:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-07-25 13:18:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-25 13:18:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-25 13:18:33,798 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2018-07-25 13:18:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:33,799 INFO L472 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-25 13:18:33,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:18:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-25 13:18:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-25 13:18:33,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:33,800 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2018-07-25 13:18:33,800 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2018-07-25 13:18:33,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:35,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:35,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:18:35,472 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:18:35,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:18:35,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:18:35,472 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 107 states. [2018-07-25 13:18:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:38,212 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-07-25 13:18:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:18:38,212 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 207 [2018-07-25 13:18:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:38,213 INFO L225 Difference]: With dead ends: 212 [2018-07-25 13:18:38,213 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:18:38,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:18:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:18:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-07-25 13:18:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-25 13:18:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-07-25 13:18:38,519 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2018-07-25 13:18:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:38,519 INFO L472 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-07-25 13:18:38,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:18:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-07-25 13:18:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-25 13:18:38,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:38,520 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2018-07-25 13:18:38,520 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2018-07-25 13:18:38,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:40,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:40,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:18:40,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:18:40,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:18:40,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:18:40,338 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 108 states. [2018-07-25 13:18:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:43,198 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-07-25 13:18:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:18:43,199 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 209 [2018-07-25 13:18:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:43,199 INFO L225 Difference]: With dead ends: 214 [2018-07-25 13:18:43,199 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:18:43,200 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:18:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:18:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-07-25 13:18:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-25 13:18:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-25 13:18:43,505 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2018-07-25 13:18:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:43,505 INFO L472 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-25 13:18:43,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:18:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-25 13:18:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-25 13:18:43,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:43,506 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2018-07-25 13:18:43,506 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2018-07-25 13:18:43,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:45,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:45,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:18:45,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:18:45,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:18:45,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=11556, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:18:45,212 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 109 states. [2018-07-25 13:18:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:47,928 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-25 13:18:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:18:47,928 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 211 [2018-07-25 13:18:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:47,929 INFO L225 Difference]: With dead ends: 216 [2018-07-25 13:18:47,929 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:18:47,929 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=216, Invalid=11556, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:18:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:18:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-07-25 13:18:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 13:18:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-07-25 13:18:48,244 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2018-07-25 13:18:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:48,244 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-07-25 13:18:48,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:18:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-07-25 13:18:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-25 13:18:48,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:48,245 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2018-07-25 13:18:48,246 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2018-07-25 13:18:48,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:50,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:50,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:18:50,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:18:50,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:18:50,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=11772, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:18:50,028 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 110 states. [2018-07-25 13:18:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:52,833 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-07-25 13:18:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:18:52,834 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 213 [2018-07-25 13:18:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:52,834 INFO L225 Difference]: With dead ends: 218 [2018-07-25 13:18:52,834 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:18:52,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=218, Invalid=11772, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:18:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:18:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-07-25 13:18:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-25 13:18:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-25 13:18:53,119 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2018-07-25 13:18:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:53,119 INFO L472 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-25 13:18:53,119 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:18:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-25 13:18:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-25 13:18:53,120 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:53,120 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2018-07-25 13:18:53,120 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2018-07-25 13:18:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:54,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:54,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:18:54,872 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:18:54,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:18:54,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=11990, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:18:54,873 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 111 states. [2018-07-25 13:18:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:57,745 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-25 13:18:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:18:57,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 215 [2018-07-25 13:18:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:57,746 INFO L225 Difference]: With dead ends: 220 [2018-07-25 13:18:57,746 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:18:57,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=220, Invalid=11990, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:18:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:18:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-07-25 13:18:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-25 13:18:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-25 13:18:58,031 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2018-07-25 13:18:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:58,031 INFO L472 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-25 13:18:58,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:18:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-25 13:18:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-25 13:18:58,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:58,032 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2018-07-25 13:18:58,032 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2018-07-25 13:18:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:59,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:59,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:18:59,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:18:59,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:18:59,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=12210, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:18:59,666 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 112 states. [2018-07-25 13:19:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:02,643 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-25 13:19:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:19:02,644 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 217 [2018-07-25 13:19:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:02,644 INFO L225 Difference]: With dead ends: 222 [2018-07-25 13:19:02,644 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:19:02,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=222, Invalid=12210, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:19:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:19:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-07-25 13:19:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-25 13:19:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-07-25 13:19:02,978 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2018-07-25 13:19:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:02,978 INFO L472 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-07-25 13:19:02,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:19:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-07-25 13:19:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-25 13:19:02,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:02,979 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2018-07-25 13:19:02,979 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2018-07-25 13:19:02,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:04,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:04,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:19:04,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:19:04,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:19:04,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=12432, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:19:04,861 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 113 states. [2018-07-25 13:19:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:07,959 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-07-25 13:19:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:19:07,959 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 219 [2018-07-25 13:19:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:07,960 INFO L225 Difference]: With dead ends: 224 [2018-07-25 13:19:07,960 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:19:07,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=12432, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:19:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:19:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-07-25 13:19:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 13:19:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-07-25 13:19:08,306 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2018-07-25 13:19:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:08,307 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-07-25 13:19:08,307 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:19:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-07-25 13:19:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-25 13:19:08,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:08,307 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2018-07-25 13:19:08,308 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2018-07-25 13:19:08,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:10,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:10,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:19:10,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:19:10,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:19:10,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=12656, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:19:10,304 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 114 states. [2018-07-25 13:19:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:13,381 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-07-25 13:19:13,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:19:13,381 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 221 [2018-07-25 13:19:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:13,382 INFO L225 Difference]: With dead ends: 226 [2018-07-25 13:19:13,382 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:19:13,382 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=226, Invalid=12656, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:19:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:19:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-07-25 13:19:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-25 13:19:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-25 13:19:13,687 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2018-07-25 13:19:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:13,687 INFO L472 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-25 13:19:13,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:19:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-25 13:19:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-25 13:19:13,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:13,688 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2018-07-25 13:19:13,688 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2018-07-25 13:19:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:15,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:15,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:19:15,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:19:15,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:19:15,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=12882, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:19:15,505 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 115 states. [2018-07-25 13:19:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:18,796 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-25 13:19:18,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:19:18,796 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 223 [2018-07-25 13:19:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:18,796 INFO L225 Difference]: With dead ends: 228 [2018-07-25 13:19:18,797 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:19:18,797 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=228, Invalid=12882, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:19:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:19:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-07-25 13:19:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-25 13:19:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-25 13:19:19,143 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2018-07-25 13:19:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:19,144 INFO L472 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-25 13:19:19,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:19:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-25 13:19:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-25 13:19:19,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:19,144 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2018-07-25 13:19:19,145 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2018-07-25 13:19:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:21,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:21,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:19:21,217 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:19:21,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:19:21,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=13110, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:19:21,218 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 116 states. [2018-07-25 13:19:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:24,573 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-25 13:19:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:19:24,573 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 225 [2018-07-25 13:19:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:24,573 INFO L225 Difference]: With dead ends: 230 [2018-07-25 13:19:24,574 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:19:24,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=13110, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:19:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:19:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-07-25 13:19:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-25 13:19:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-07-25 13:19:24,928 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2018-07-25 13:19:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:24,928 INFO L472 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-07-25 13:19:24,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:19:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-07-25 13:19:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-25 13:19:24,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:24,929 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2018-07-25 13:19:24,929 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2018-07-25 13:19:24,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:27,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:27,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:19:27,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:19:27,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:19:27,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=13340, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:19:27,067 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 117 states. [2018-07-25 13:19:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:30,291 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-07-25 13:19:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:19:30,291 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 227 [2018-07-25 13:19:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:30,292 INFO L225 Difference]: With dead ends: 232 [2018-07-25 13:19:30,292 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:19:30,293 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=232, Invalid=13340, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:19:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:19:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-07-25 13:19:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-25 13:19:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-25 13:19:30,681 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2018-07-25 13:19:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:30,682 INFO L472 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-25 13:19:30,682 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:19:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-25 13:19:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-25 13:19:30,682 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:30,682 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1] [2018-07-25 13:19:30,683 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886654, now seen corresponding path program 113 times [2018-07-25 13:19:30,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:32,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:32,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:19:32,836 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:19:32,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:19:32,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=13572, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:19:32,837 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 118 states. [2018-07-25 13:19:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,356 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-25 13:19:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:19:36,356 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 229 [2018-07-25 13:19:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,357 INFO L225 Difference]: With dead ends: 234 [2018-07-25 13:19:36,357 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:19:36,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=13572, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:19:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:19:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2018-07-25 13:19:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-25 13:19:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-07-25 13:19:36,729 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2018-07-25 13:19:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:36,730 INFO L472 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-07-25 13:19:36,730 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:19:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-07-25 13:19:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-25 13:19:36,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:36,731 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1] [2018-07-25 13:19:36,731 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash -156201532, now seen corresponding path program 114 times [2018-07-25 13:19:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:38,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:38,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:19:38,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:19:38,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:19:38,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=13806, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:19:38,788 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 119 states. Received shutdown request... [2018-07-25 13:19:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:19:40,854 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:19:40,860 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:19:40,861 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:19:40 BoogieIcfgContainer [2018-07-25 13:19:40,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:19:40,862 INFO L168 Benchmark]: Toolchain (without parser) took 251853.50 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 463.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:40,862 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:19:40,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.88 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:19:40,863 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 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:19:40,863 INFO L168 Benchmark]: RCFGBuilder took 220.85 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:19:40,864 INFO L168 Benchmark]: TraceAbstraction took 251563.01 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 453.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:40,870 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.18 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 41.88 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 23.14 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 220.85 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 251563.01 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 453.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (232states) and interpolant automaton (currently 73 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 251.4s OverallTime, 115 OverallIterations, 115 TraceHistogramMax, 140.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 229 SDslu, 0 SDs, 0 SdLazy, 1050306 SolverSat, 0 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 98.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6899 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6899 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 76.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred 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: 15.6s AutomataMinimizationTime, 114 MinimizatonAttempts, 114 StatesRemovedByMinimization, 114 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 81.7s InterpolantComputationTime, 13455 NumberOfCodeBlocks, 13455 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 13340 ConstructedInterpolants, 0 QuantifiedInterpolants, 46329550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 1 PerfectInterpolantSequences, 0/506920 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/divisibilityWithArray.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-19-40-879.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-19-40-879.csv Completed graceful shutdown