java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:21:32,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:21:32,167 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:21:32,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:21:32,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:21:32,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:21:32,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:21:32,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:21:32,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:21:32,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:21:32,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:21:32,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:21:32,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:21:32,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:21:32,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:21:32,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:21:32,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:21:32,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:21:32,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:21:32,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:21:32,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:21:32,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:21:32,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:21:32,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:21:32,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:21:32,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:21:32,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:21:32,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:21:32,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:21:32,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:21:32,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:21:32,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:21:32,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:21:32,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:21:32,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:21:32,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:21:32,215 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:21:32,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:21:32,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:21:32,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:21:32,232 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:21:32,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:21:32,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:21:32,233 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:21:32,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:21:32,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:21:32,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:21:32,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:21:32,313 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:21:32,314 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:21:32,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2018-09-26 08:21:32,315 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2018-09-26 08:21:32,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:21:32,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:21:32,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:21:32,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:21:32,378 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:21:32,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,421 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:21:32,422 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:21:32,422 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:21:32,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:21:32,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:21:32,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:21:32,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:21:32,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:21:32,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:21:32,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:21:32,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:21:32,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/1) ... [2018-09-26 08:21:32,549 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:21:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:21:32,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:21:32,686 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:21:32,687 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:21:32 BoogieIcfgContainer [2018-09-26 08:21:32,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:21:32,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:21:32,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:21:32,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:21:32,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:21:32" (1/2) ... [2018-09-26 08:21:32,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0108e8 and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:21:32, skipping insertion in model container [2018-09-26 08:21:32,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:21:32" (2/2) ... [2018-09-26 08:21:32,696 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2018-09-26 08:21:32,707 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:21:32,715 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:21:32,765 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:21:32,766 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:21:32,766 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:21:32,767 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:21:32,767 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:21:32,767 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:21:32,767 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:21:32,767 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:21:32,768 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:21:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-09-26 08:21:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 08:21:32,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:32,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 08:21:32,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:32,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-26 08:21:32,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:32,886 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:21:32,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:21:32,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:21:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:21:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:21:32,906 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-09-26 08:21:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:32,932 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:21:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:21:32,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 08:21:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:32,945 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:21:32,945 INFO L226 Difference]: Without dead ends: 4 [2018-09-26 08:21:32,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:21:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-26 08:21:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-26 08:21:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-26 08:21:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-26 08:21:32,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-26 08:21:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:32,988 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-26 08:21:32,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:21:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-26 08:21:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:21:32,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:32,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:21:32,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:32,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-26 08:21:32,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:21:33,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:21:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:21:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:21:33,013 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-26 08:21:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,027 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-26 08:21:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:21:33,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 08:21:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,028 INFO L225 Difference]: With dead ends: 6 [2018-09-26 08:21:33,028 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:21:33,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:21:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:21:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:21:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:21:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:21:33,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:21:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,032 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:21:33,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:21:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:21:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:21:33,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,033 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-26 08:21:33,034 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-26 08:21:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:21:33,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:21:33,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:21:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:21:33,069 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:21:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,081 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:21:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:21:33,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:21:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,083 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:21:33,083 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:21:33,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:21:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:21:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:21:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:21:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:21:33,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:21:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,087 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:21:33,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:21:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:21:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:21:33,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,087 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-26 08:21:33,088 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-26 08:21:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:21:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:21:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:21:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:21:33,138 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:21:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,168 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:21:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:21:33,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:21:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,171 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:21:33,171 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:21:33,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:21:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:21:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:21:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:21:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:21:33,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:21:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,175 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:21:33,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:21:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:21:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:21:33,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,176 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-26 08:21:33,176 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-26 08:21:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:21:33,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:21:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:21:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:21:33,243 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:21:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,272 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:21:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:21:33,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:21:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,273 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:21:33,273 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:21:33,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:21:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:21:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:21:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:21:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:21:33,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:21:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,277 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:21:33,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:21:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:21:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:21:33,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,278 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-26 08:21:33,279 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-26 08:21:33,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:21:33,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:21:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:21:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:21:33,328 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:21:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,341 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:21:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:21:33,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:21:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,343 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:21:33,343 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:21:33,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:21:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:21:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:21:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:21:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:21:33,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:21:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,347 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:21:33,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:21:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:21:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:21:33,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,348 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-26 08:21:33,348 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-26 08:21:33,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:21:33,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:21:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:21:33,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:21:33,429 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:21:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,442 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:21:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:21:33,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:21:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,443 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:21:33,443 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:21:33,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:21:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:21:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:21:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:21:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:21:33,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:21:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,448 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:21:33,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:21:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:21:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:21:33,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,449 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-26 08:21:33,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-26 08:21:33,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:21:33,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:21:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:21:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:21:33,494 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:21:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,515 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:21:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:21:33,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:21:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,517 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:21:33,517 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:21:33,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:21:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:21:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:21:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:21:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:21:33,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:21:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,528 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:21:33,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:21:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:21:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:21:33,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,529 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-26 08:21:33,529 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-26 08:21:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:21:33,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:21:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:21:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:21:33,613 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:21:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,628 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:21:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:21:33,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:21:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,629 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:21:33,629 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:21:33,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:21:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:21:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:21:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:21:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:21:33,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:21:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,634 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:21:33,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:21:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:21:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:21:33,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,635 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-26 08:21:33,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-26 08:21:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:21:33,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:21:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:21:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:21:33,681 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:21:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,695 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:21:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:21:33,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:21:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,697 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:21:33,697 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:21:33,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:21:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:21:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:21:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:21:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:21:33,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:21:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:21:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:21:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:21:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:21:33,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,703 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-26 08:21:33,703 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-26 08:21:33,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:21:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:21:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:21:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:21:33,752 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:21:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,767 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:21:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:21:33,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:21:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,768 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:21:33,768 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:21:33,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:21:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:21:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:21:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:21:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:21:33,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:21:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,774 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:21:33,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:21:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:21:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:21:33,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,775 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-26 08:21:33,775 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,776 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-26 08:21:33,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:21:33,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:21:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:21:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:21:33,852 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:21:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,873 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:21:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:21:33,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:21:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,874 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:21:33,874 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:21:33,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:21:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:21:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:21:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:21:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:21:33,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:21:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,880 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:21:33,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:21:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:21:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:21:33,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,881 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-26 08:21:33,881 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-26 08:21:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:21:33,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:21:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:21:33,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:21:33,949 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 08:21:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,983 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:21:33,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:21:33,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 08:21:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,985 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:21:33,985 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:21:33,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:21:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:21:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:21:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:21:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:21:33,993 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:21:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,994 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:21:33,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:21:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:21:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:21:33,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,997 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-26 08:21:33,997 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-26 08:21:34,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:21:34,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:21:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:21:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:21:34,089 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 08:21:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,120 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:21:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:21:34,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 08:21:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,124 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:21:34,124 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:21:34,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:21:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:21:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:21:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:21:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:21:34,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:21:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,132 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:21:34,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:21:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:21:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:21:34,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,133 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-26 08:21:34,134 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-26 08:21:34,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:21:34,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:21:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:21:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:21:34,199 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 08:21:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,213 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:21:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:21:34,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 08:21:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,214 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:21:34,214 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:21:34,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:21:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:21:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:21:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:21:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:21:34,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:21:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,226 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:21:34,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:21:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:21:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:21:34,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,228 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-26 08:21:34,228 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-26 08:21:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:21:34,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:21:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:21:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:21:34,302 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 08:21:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,313 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:21:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:21:34,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 08:21:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,315 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:21:34,315 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:21:34,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:21:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:21:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:21:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:21:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:21:34,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:21:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,320 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:21:34,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:21:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:21:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:21:34,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,321 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-26 08:21:34,322 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-26 08:21:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:21:34,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:21:34,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:21:34,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:21:34,377 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 08:21:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,388 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:21:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:21:34,389 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 08:21:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,390 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:21:34,390 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:21:34,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:21:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:21:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:21:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:21:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:21:34,395 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:21:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,395 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:21:34,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:21:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:21:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:21:34,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,396 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-26 08:21:34,397 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-26 08:21:34,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:21:34,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:21:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:21:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:21:34,461 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 08:21:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,474 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:21:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:21:34,474 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 08:21:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,475 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:21:34,475 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:21:34,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:21:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:21:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:21:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:21:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:21:34,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:21:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:21:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:21:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:21:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:21:34,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,481 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-26 08:21:34,482 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-26 08:21:34,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:21:34,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:21:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:21:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:21:34,550 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 08:21:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,566 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:21:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:21:34,567 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 08:21:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,569 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:21:34,570 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:21:34,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:21:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:21:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:21:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:21:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:21:34,575 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:21:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,579 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:21:34,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:21:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:21:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:21:34,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,581 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-26 08:21:34,581 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-26 08:21:34,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:21:34,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:21:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:21:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:21:34,653 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 08:21:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,665 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:21:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:21:34,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 08:21:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,666 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:21:34,667 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:21:34,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:21:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:21:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:21:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:21:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:21:34,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:21:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,672 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:21:34,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:21:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:21:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:21:34,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,673 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-26 08:21:34,673 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-26 08:21:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:21:34,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:21:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:21:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:21:34,745 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 08:21:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,761 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:21:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:21:34,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 08:21:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,762 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:21:34,762 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:21:34,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:21:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:21:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:21:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:21:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:21:34,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:21:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,768 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:21:34,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:21:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:21:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:21:34,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,769 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-26 08:21:34,769 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-26 08:21:34,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:21:34,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:21:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:21:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:21:34,850 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 08:21:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,873 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:21:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:21:34,873 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 08:21:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,874 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:21:34,874 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:21:34,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:21:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:21:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:21:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:21:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:21:34,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:21:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,886 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:21:34,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:21:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:21:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:21:34,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,889 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-26 08:21:34,890 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-26 08:21:34,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:21:35,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:21:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:21:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:21:35,004 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 08:21:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,027 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:21:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:21:35,027 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 08:21:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,028 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:21:35,028 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:21:35,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:21:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:21:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:21:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:21:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:21:35,034 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:21:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,034 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:21:35,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:21:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:21:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:21:35,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,035 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-26 08:21:35,036 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-26 08:21:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:21:35,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:21:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:21:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:35,132 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 08:21:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,149 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:21:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:21:35,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 08:21:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,150 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:21:35,150 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:21:35,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:21:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:21:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:21:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:21:35,155 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:21:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,155 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:21:35,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:21:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:21:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:21:35,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,156 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-26 08:21:35,157 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-26 08:21:35,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:21:35,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:21:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:21:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:21:35,253 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 08:21:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,267 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:21:35,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:21:35,267 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 08:21:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,268 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:21:35,268 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:21:35,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:21:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:21:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:21:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:21:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:21:35,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:21:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,273 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:21:35,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:21:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:21:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:21:35,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,275 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-26 08:21:35,275 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-26 08:21:35,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:21:35,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:21:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:21:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:21:35,383 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 08:21:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,396 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:21:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:21:35,397 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 08:21:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,397 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:21:35,397 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:21:35,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:21:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:21:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:21:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:21:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:21:35,402 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:21:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,402 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:21:35,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:21:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:21:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:21:35,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,404 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-26 08:21:35,404 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-26 08:21:35,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:21:35,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:21:35,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:21:35,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:21:35,522 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 08:21:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,539 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:21:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:21:35,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 08:21:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,540 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:21:35,541 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:21:35,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:21:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:21:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:21:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:21:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:21:35,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:21:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,546 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:21:35,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:21:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:21:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:21:35,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,547 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-26 08:21:35,548 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-26 08:21:35,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:21:35,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:21:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:21:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:35,694 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 08:21:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,731 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:21:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:21:35,732 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 08:21:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,732 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:21:35,733 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:21:35,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:21:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:21:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:21:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:21:35,742 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:21:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:21:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:21:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:21:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:21:35,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,743 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-26 08:21:35,743 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-26 08:21:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:21:35,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:21:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:21:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:21:35,882 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 08:21:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,899 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:21:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:21:35,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 08:21:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,900 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:21:35,900 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:21:35,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:21:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:21:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:21:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:21:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:21:35,909 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:21:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,909 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:21:35,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:21:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:21:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:21:35,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,914 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-26 08:21:35,914 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-26 08:21:35,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:21:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:21:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:21:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:21:36,057 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 08:21:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,075 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:21:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:21:36,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 08:21:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,076 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:21:36,076 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:21:36,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:21:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:21:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:21:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:21:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:21:36,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:21:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,085 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:21:36,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:21:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:21:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:21:36,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,086 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-26 08:21:36,086 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-26 08:21:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:21:36,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:21:36,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:21:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:21:36,234 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 08:21:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,252 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:21:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:21:36,252 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 08:21:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,253 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:21:36,253 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:21:36,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:21:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:21:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:21:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:21:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:21:36,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:21:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,259 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:21:36,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:21:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:21:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:21:36,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,260 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-26 08:21:36,260 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-26 08:21:36,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:21:36,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:21:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:21:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:36,405 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 08:21:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,423 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:21:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:21:36,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 08:21:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,424 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:21:36,424 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:21:36,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:21:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:21:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:21:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:21:36,431 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:21:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,431 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:21:36,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:21:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:21:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:21:36,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,432 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-26 08:21:36,432 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-26 08:21:36,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:21:36,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:21:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:21:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:21:36,643 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 08:21:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,661 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:21:36,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:21:36,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 08:21:36,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,662 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:21:36,662 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:21:36,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:21:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:21:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:21:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:21:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:21:36,671 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:21:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,671 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:21:36,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:21:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:21:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:21:36,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,677 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-26 08:21:36,677 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-26 08:21:36,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:21:36,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:21:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:21:36,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:36,817 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 08:21:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,835 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:21:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:21:36,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 08:21:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,836 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:21:36,836 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:21:36,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:21:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:21:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:21:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:21:36,844 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:21:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,844 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:21:36,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:21:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:21:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:21:36,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,845 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-26 08:21:36,845 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-26 08:21:36,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:21:36,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:21:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:21:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:36,988 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 08:21:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,010 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:21:37,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:21:37,011 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 08:21:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,011 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:21:37,011 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:21:37,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:21:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:21:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:21:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:21:37,015 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:21:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,015 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:21:37,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:21:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:21:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:21:37,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,016 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-26 08:21:37,016 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-26 08:21:37,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:21:37,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:21:37,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:21:37,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:37,189 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 08:21:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,212 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:21:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:21:37,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 08:21:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,213 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:21:37,213 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:21:37,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:21:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:21:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:21:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:21:37,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:21:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,221 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:21:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:21:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:21:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:21:37,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,222 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-26 08:21:37,222 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-26 08:21:37,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:21:37,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:21:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:21:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:37,383 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 08:21:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,409 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:21:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:21:37,409 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 08:21:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,410 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:21:37,410 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:21:37,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:21:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:21:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:21:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:21:37,418 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:21:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:21:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:21:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:21:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:21:37,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,419 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-26 08:21:37,419 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-26 08:21:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:21:37,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:21:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:21:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:37,589 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 08:21:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,613 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:21:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:21:37,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 08:21:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,614 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:21:37,614 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:21:37,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:21:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:21:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:21:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:21:37,618 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:21:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,618 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:21:37,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:21:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:21:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:21:37,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,619 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-26 08:21:37,619 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-26 08:21:37,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:21:37,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:21:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:21:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:37,785 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 08:21:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,803 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:21:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:21:37,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 08:21:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,804 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:21:37,804 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:21:37,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:21:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:21:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:21:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:21:37,808 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:21:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,808 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:21:37,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:21:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:21:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:21:37,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,809 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-26 08:21:37,809 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-26 08:21:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:21:37,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:21:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:21:37,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:37,975 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 08:21:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,995 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:21:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:21:37,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 08:21:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,996 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:21:37,996 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:21:37,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:21:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:21:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:21:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:21:38,000 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:21:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,000 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:21:38,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:21:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:21:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:21:38,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,001 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-26 08:21:38,001 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-26 08:21:38,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:21:38,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:21:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:21:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:38,168 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 08:21:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,189 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:21:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:21:38,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 08:21:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,190 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:21:38,190 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:21:38,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:21:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:21:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:21:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:21:38,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:21:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,194 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:21:38,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:21:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:21:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:21:38,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,195 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-26 08:21:38,195 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-26 08:21:38,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:21:38,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:21:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:21:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:38,371 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 08:21:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,391 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:21:38,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:21:38,391 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 08:21:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,392 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:21:38,392 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:21:38,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:21:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:21:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:21:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:21:38,395 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:21:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:21:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:21:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:21:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:21:38,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,396 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-26 08:21:38,397 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-26 08:21:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:21:38,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:21:38,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:21:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:38,573 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 08:21:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,597 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:21:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:21:38,597 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 08:21:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,598 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:21:38,598 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:21:38,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:21:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:21:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:21:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:21:38,601 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:21:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,602 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:21:38,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:21:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:21:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:21:38,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,603 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-26 08:21:38,603 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-26 08:21:38,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:21:38,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:21:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:21:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:38,787 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 08:21:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,813 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:21:38,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:21:38,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-26 08:21:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,815 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:21:38,815 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:21:38,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:21:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:21:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:21:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:21:38,819 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:21:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,819 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:21:38,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:21:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:21:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:21:38,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,820 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-26 08:21:38,821 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-09-26 08:21:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:21:39,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:21:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:21:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:39,034 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-26 08:21:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,059 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:21:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:21:39,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-26 08:21:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,060 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:21:39,060 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:21:39,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:21:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:21:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:21:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:21:39,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:21:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,064 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:21:39,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:21:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:21:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:21:39,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,065 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-26 08:21:39,066 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-09-26 08:21:39,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:21:39,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:21:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:21:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:39,296 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-26 08:21:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,317 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:21:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:21:39,318 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-26 08:21:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,318 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:21:39,318 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:21:39,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:21:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:21:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:21:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:21:39,322 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:21:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,322 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:21:39,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:21:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:21:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:21:39,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,323 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-26 08:21:39,323 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-09-26 08:21:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:21:39,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:21:39,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:21:39,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:39,498 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-26 08:21:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,527 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:21:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:21:39,527 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-26 08:21:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,528 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:21:39,528 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:21:39,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:21:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:21:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:21:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:21:39,532 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:21:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:21:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:21:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:21:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:21:39,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,533 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-26 08:21:39,533 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-09-26 08:21:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:21:39,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:21:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:21:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:39,717 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-26 08:21:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,746 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:21:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:21:39,747 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-26 08:21:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,747 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:21:39,748 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:21:39,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:21:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:21:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:21:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:21:39,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:21:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,752 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:21:39,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:21:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:21:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:21:39,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,753 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-26 08:21:39,753 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-09-26 08:21:39,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:21:39,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:21:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:21:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:39,945 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-26 08:21:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,974 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:21:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:21:39,974 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-26 08:21:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,975 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:21:39,975 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:21:39,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:21:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:21:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:21:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:21:39,978 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:21:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,979 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:21:39,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:21:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:21:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:21:39,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,979 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-26 08:21:39,980 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-09-26 08:21:39,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:21:40,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:21:40,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:21:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:40,171 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-26 08:21:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,202 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:21:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:21:40,202 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-26 08:21:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,202 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:21:40,203 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:21:40,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:21:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:21:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:21:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:21:40,206 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:21:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,206 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:21:40,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:21:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:21:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:21:40,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,207 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-26 08:21:40,208 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-09-26 08:21:40,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:21:40,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:21:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:21:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:40,397 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-26 08:21:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,426 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:21:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:21:40,426 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-26 08:21:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,427 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:21:40,427 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:21:40,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:21:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:21:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:21:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:21:40,430 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:21:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,431 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:21:40,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:21:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:21:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:21:40,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,431 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-26 08:21:40,432 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-09-26 08:21:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:21:40,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:21:40,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:21:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:40,627 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-26 08:21:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,655 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:21:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:21:40,655 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-26 08:21:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,656 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:21:40,656 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:21:40,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:21:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:21:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:21:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:21:40,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:21:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,665 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:21:40,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:21:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:21:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:21:40,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,666 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-26 08:21:40,666 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-09-26 08:21:40,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:21:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:21:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:21:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:40,860 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-26 08:21:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,889 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:21:40,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:21:40,890 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-26 08:21:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,890 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:21:40,890 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:21:40,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:21:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:21:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:21:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:21:40,894 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:21:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,894 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:21:40,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:21:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:21:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:21:40,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,895 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-09-26 08:21:40,895 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-09-26 08:21:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:21:41,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:21:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:21:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:41,082 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-26 08:21:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,110 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:21:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:21:41,110 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-26 08:21:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,111 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:21:41,111 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:21:41,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:21:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:21:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:21:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:21:41,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:21:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,115 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:21:41,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:21:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:21:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:21:41,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,116 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-09-26 08:21:41,116 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-09-26 08:21:41,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:21:41,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:21:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:21:41,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:21:41,333 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-09-26 08:21:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,364 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:21:41,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:21:41,365 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-09-26 08:21:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,365 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:21:41,366 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:21:41,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:21:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:21:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:21:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:21:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:21:41,370 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:21:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,370 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:21:41,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:21:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:21:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:21:41,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,373 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-09-26 08:21:41,373 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-09-26 08:21:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:21:41,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:21:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:21:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:41,639 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-09-26 08:21:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,686 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:21:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:21:41,687 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-09-26 08:21:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,687 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:21:41,688 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:21:41,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:21:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:21:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:21:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:21:41,692 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:21:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,693 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:21:41,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:21:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:21:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:21:41,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,694 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-09-26 08:21:41,694 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-09-26 08:21:41,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:21:41,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:21:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:21:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:41,988 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-09-26 08:21:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,029 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:21:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:21:42,029 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-09-26 08:21:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,030 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:21:42,030 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:21:42,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:21:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:21:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:21:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:21:42,034 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:21:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,035 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:21:42,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:21:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:21:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:21:42,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,036 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-09-26 08:21:42,036 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-09-26 08:21:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:21:42,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:21:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:21:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:42,250 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-09-26 08:21:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,280 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:21:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:21:42,281 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-09-26 08:21:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,281 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:21:42,281 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:21:42,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:21:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:21:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:21:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:21:42,286 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:21:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:21:42,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:21:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:21:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:21:42,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,288 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-09-26 08:21:42,288 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,288 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-09-26 08:21:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:21:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:21:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:21:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:42,510 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-09-26 08:21:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,546 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:21:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:21:42,547 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-09-26 08:21:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,547 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:21:42,547 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:21:42,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:21:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:21:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:21:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:21:42,553 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:21:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:21:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:21:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:21:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:21:42,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,554 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-09-26 08:21:42,555 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-09-26 08:21:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:21:42,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:21:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:21:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:42,778 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-09-26 08:21:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,811 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:21:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:21:42,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-09-26 08:21:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,812 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:21:42,812 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:21:42,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:21:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:21:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:21:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:21:42,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:21:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:21:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:21:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:21:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:21:42,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,817 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-09-26 08:21:42,818 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-09-26 08:21:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:21:43,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:21:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:21:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:43,046 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-09-26 08:21:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,097 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:21:43,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:21:43,097 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-09-26 08:21:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,098 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:21:43,098 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:21:43,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:21:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:21:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:21:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:21:43,103 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:21:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,103 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:21:43,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:21:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:21:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:21:43,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,104 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-09-26 08:21:43,104 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-09-26 08:21:43,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:21:43,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:21:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:21:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:43,337 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-09-26 08:21:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,367 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:21:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:21:43,368 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-09-26 08:21:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,368 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:21:43,369 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:21:43,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:21:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:21:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:21:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:21:43,373 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:21:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,373 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:21:43,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:21:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:21:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:21:43,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,374 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-09-26 08:21:43,374 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-09-26 08:21:43,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:21:43,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:21:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:21:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:43,597 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-09-26 08:21:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,640 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:21:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:21:43,640 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-09-26 08:21:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,641 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:21:43,641 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:21:43,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:21:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:21:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:21:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:21:43,644 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:21:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,645 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:21:43,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:21:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:21:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:21:43,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,646 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-09-26 08:21:43,646 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-09-26 08:21:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:21:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:21:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:21:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:43,876 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-09-26 08:21:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,905 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:21:43,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:21:43,906 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-09-26 08:21:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,906 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:21:43,906 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:21:43,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:21:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:21:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:21:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:21:43,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:21:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,912 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:21:43,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:21:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:21:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:21:43,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,913 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-09-26 08:21:43,913 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-09-26 08:21:43,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:21:44,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:21:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:21:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:44,142 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-09-26 08:21:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,186 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:21:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:21:44,186 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-09-26 08:21:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,187 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:21:44,187 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:21:44,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:21:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:21:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:21:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:21:44,192 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:21:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,192 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:21:44,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:21:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:21:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:21:44,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,194 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-09-26 08:21:44,194 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-09-26 08:21:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:21:44,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:21:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:21:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:44,474 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-09-26 08:21:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,524 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:21:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:21:44,524 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-09-26 08:21:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,525 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:21:44,525 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:21:44,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:21:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:21:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:21:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:21:44,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:21:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,529 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:21:44,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:21:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:21:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:21:44,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,530 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-09-26 08:21:44,531 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-09-26 08:21:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:21:44,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:21:44,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:21:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:44,783 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-09-26 08:21:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,813 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:21:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:21:44,813 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-09-26 08:21:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,814 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:21:44,814 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:21:44,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:21:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:21:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:21:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:21:44,818 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:21:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,818 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:21:44,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:21:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:21:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:21:44,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,819 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-09-26 08:21:44,819 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-09-26 08:21:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:21:45,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:21:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:21:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:45,042 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-09-26 08:21:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,092 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:21:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:21:45,092 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-09-26 08:21:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,093 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:21:45,093 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:21:45,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:21:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:21:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:21:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:21:45,097 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:21:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,097 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:21:45,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:21:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:21:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:21:45,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,098 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-09-26 08:21:45,098 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-09-26 08:21:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:21:45,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:21:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:21:45,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:45,320 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-09-26 08:21:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,372 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:21:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:21:45,372 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-09-26 08:21:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,373 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:21:45,373 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:21:45,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:21:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:21:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:21:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:21:45,376 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:21:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,377 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:21:45,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:21:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:21:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:21:45,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,378 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-09-26 08:21:45,378 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-09-26 08:21:45,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:21:45,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:21:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:21:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:45,604 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-09-26 08:21:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,658 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:21:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:21:45,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-09-26 08:21:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,659 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:21:45,660 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:21:45,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:21:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:21:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:21:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:21:45,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:21:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,664 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:21:45,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:21:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:21:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:21:45,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,664 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-09-26 08:21:45,665 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-09-26 08:21:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:21:45,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:21:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:21:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:45,911 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-09-26 08:21:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,967 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:21:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:21:45,968 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-09-26 08:21:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,968 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:21:45,968 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:21:45,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:21:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:21:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:21:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:21:45,972 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:21:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,973 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:21:45,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:21:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:21:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:21:45,974 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,974 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-09-26 08:21:45,974 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-09-26 08:21:45,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:21:46,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:21:46,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:21:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:46,233 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-09-26 08:21:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,277 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:21:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:21:46,277 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-09-26 08:21:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,278 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:21:46,278 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:21:46,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:21:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:21:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:21:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:21:46,282 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:21:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,282 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:21:46,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:21:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:21:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:21:46,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,283 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-09-26 08:21:46,283 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-09-26 08:21:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:21:46,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:21:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:21:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:46,518 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-09-26 08:21:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,555 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:21:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:21:46,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-09-26 08:21:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,556 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:21:46,557 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:21:46,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:21:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:21:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:21:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:21:46,560 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:21:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,560 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:21:46,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:21:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:21:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:21:46,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,561 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-09-26 08:21:46,562 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-09-26 08:21:46,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:21:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:46,810 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-09-26 08:21:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,844 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:21:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:21:46,845 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-09-26 08:21:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,845 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:21:46,845 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:21:46,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:21:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:21:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:21:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:21:46,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:21:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,849 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:21:46,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:21:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:21:46,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,850 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-09-26 08:21:46,851 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-09-26 08:21:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:47,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:21:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:21:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:47,072 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-09-26 08:21:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,109 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:21:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:21:47,110 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-09-26 08:21:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,110 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:21:47,111 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:21:47,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:21:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:21:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:21:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:21:47,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:21:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,114 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:21:47,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:21:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:21:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:21:47,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,116 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-09-26 08:21:47,116 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-09-26 08:21:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:21:47,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:47,340 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-09-26 08:21:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,383 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:21:47,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:21:47,383 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-09-26 08:21:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,384 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:21:47,384 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:21:47,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:21:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:21:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:21:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:21:47,388 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:21:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,388 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:21:47,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:21:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:21:47,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,389 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-09-26 08:21:47,389 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-09-26 08:21:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:47,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:21:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:21:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:47,623 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-09-26 08:21:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,676 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:21:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:21:47,676 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-09-26 08:21:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,677 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:21:47,677 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:21:47,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:21:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:21:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:21:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:21:47,681 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:21:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,681 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:21:47,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:21:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:21:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:21:47,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,682 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-09-26 08:21:47,682 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-09-26 08:21:47,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:21:47,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:47,919 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-09-26 08:21:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,990 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:21:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:21:47,991 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-09-26 08:21:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,991 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:21:47,991 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:21:47,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:21:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:21:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:21:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:21:47,995 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:21:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,996 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:21:47,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:21:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:21:47,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,997 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-09-26 08:21:47,997 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-09-26 08:21:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:21:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:21:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:48,255 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-09-26 08:21:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,323 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:21:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:21:48,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-09-26 08:21:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,324 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:21:48,324 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:21:48,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:21:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:21:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:21:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:21:48,328 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:21:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,328 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:21:48,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:21:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:21:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:21:48,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,329 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-09-26 08:21:48,329 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-09-26 08:21:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:21:48,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:48,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:48,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:48,555 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-09-26 08:21:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,613 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:21:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:21:48,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-09-26 08:21:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,614 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:21:48,614 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:21:48,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:21:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:21:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:21:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:21:48,618 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:21:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,618 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:21:48,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:21:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:21:48,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,619 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-09-26 08:21:48,619 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-09-26 08:21:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:21:48,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:21:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:21:48,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:48,946 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-09-26 08:21:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,987 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:21:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:21:48,987 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-09-26 08:21:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,988 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:21:48,988 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:21:48,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:21:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:21:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:21:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:21:48,992 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:21:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,993 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:21:48,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:21:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:21:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:21:48,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,994 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-09-26 08:21:48,994 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-09-26 08:21:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:21:49,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:21:49,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:21:49,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:49,318 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-09-26 08:21:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,401 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:21:49,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:21:49,401 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-09-26 08:21:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,402 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:21:49,402 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:21:49,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:21:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:21:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:21:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:21:49,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:21:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,406 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:21:49,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:21:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:21:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:21:49,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,407 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-09-26 08:21:49,407 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-09-26 08:21:49,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:21:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:21:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:21:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:49,610 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-09-26 08:21:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,674 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:21:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:21:49,674 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-09-26 08:21:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,675 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:21:49,675 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:21:49,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:21:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:21:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:21:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:21:49,678 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:21:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,678 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:21:49,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:21:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:21:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:21:49,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,679 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-09-26 08:21:49,679 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-09-26 08:21:49,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:21:49,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:21:49,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:21:49,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:49,942 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-09-26 08:21:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,981 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:21:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:21:49,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-09-26 08:21:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,982 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:21:49,982 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:21:49,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:21:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:21:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:21:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:21:49,985 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:21:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,986 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:21:49,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:21:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:21:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:21:49,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,987 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-09-26 08:21:49,987 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-09-26 08:21:49,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:21:50,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:21:50,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:21:50,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:50,263 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-09-26 08:21:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,331 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:21:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:21:50,331 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-09-26 08:21:50,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,332 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:21:50,332 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:21:50,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:21:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:21:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:21:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:21:50,336 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:21:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,336 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:21:50,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:21:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:21:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:21:50,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,337 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-09-26 08:21:50,337 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-09-26 08:21:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:21:50,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:21:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:21:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:50,643 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-09-26 08:21:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,703 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:21:50,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:21:50,703 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-09-26 08:21:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,704 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:21:50,704 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:21:50,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:21:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:21:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:21:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:21:50,709 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:21:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,709 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:21:50,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:21:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:21:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:21:50,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,710 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-09-26 08:21:50,710 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,711 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-09-26 08:21:50,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:21:51,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:21:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:21:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:51,059 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-09-26 08:21:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,161 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:21:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:21:51,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-09-26 08:21:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,162 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:21:51,162 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:21:51,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:21:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:21:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:21:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:21:51,166 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:21:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,166 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:21:51,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:21:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:21:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:21:51,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,167 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-09-26 08:21:51,168 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-09-26 08:21:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:21:51,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:21:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:21:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:51,459 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-09-26 08:21:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,490 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:21:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:21:51,490 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-09-26 08:21:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,491 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:21:51,491 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:21:51,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:21:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:21:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:21:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:21:51,494 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:21:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,495 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:21:51,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:21:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:21:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:21:51,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,497 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-09-26 08:21:51,497 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-09-26 08:21:51,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:21:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:21:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:21:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:21:51,746 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-09-26 08:21:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,851 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:21:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:21:51,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-09-26 08:21:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,852 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:21:51,852 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:21:51,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:21:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:21:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:21:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:21:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:21:51,857 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:21:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,857 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:21:51,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:21:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:21:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:21:51,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,858 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-09-26 08:21:51,858 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-09-26 08:21:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:21:52,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:21:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:21:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:52,100 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-09-26 08:21:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,135 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:21:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:21:52,135 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-09-26 08:21:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,136 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:21:52,136 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:21:52,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:21:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:21:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:21:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:21:52,140 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:21:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,140 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:21:52,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:21:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:21:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:21:52,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,142 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-09-26 08:21:52,142 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-09-26 08:21:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:21:52,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:21:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:21:52,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:21:52,437 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-09-26 08:21:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,488 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:21:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:21:52,489 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-09-26 08:21:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,489 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:21:52,489 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:21:52,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:21:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:21:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:21:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:21:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:21:52,493 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:21:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,493 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:21:52,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:21:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:21:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:21:52,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,494 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-09-26 08:21:52,494 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-09-26 08:21:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:21:52,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:21:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:21:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:52,820 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-09-26 08:21:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,888 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:21:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:21:52,888 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-09-26 08:21:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,889 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:21:52,889 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:21:52,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:21:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:21:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:21:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:21:52,893 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:21:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,893 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:21:52,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:21:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:21:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:21:52,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,894 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-09-26 08:21:52,895 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-09-26 08:21:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:21:53,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:21:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:21:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:21:53,229 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-09-26 08:21:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,270 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:21:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:21:53,270 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-09-26 08:21:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,271 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:21:53,271 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:21:53,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:21:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:21:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:21:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:21:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:21:53,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:21:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,274 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:21:53,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:21:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:21:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:21:53,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,275 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-09-26 08:21:53,275 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-09-26 08:21:53,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:21:53,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:21:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:21:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:21:53,555 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-09-26 08:21:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,603 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:21:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:21:53,604 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-09-26 08:21:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,604 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:21:53,605 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:21:53,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:21:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:21:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:21:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:21:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:21:53,608 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:21:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,609 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:21:53,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:21:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:21:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:21:53,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,609 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-09-26 08:21:53,610 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-09-26 08:21:53,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:21:53,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:21:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:21:53,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:21:53,967 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-09-26 08:21:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,029 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:21:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:21:54,029 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-09-26 08:21:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,030 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:21:54,030 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:21:54,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:21:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:21:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:21:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:21:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:21:54,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:21:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,033 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:21:54,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:21:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:21:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:21:54,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,033 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-09-26 08:21:54,034 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-09-26 08:21:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:21:54,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:21:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:21:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:54,255 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-09-26 08:21:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,344 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:21:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:21:54,344 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-09-26 08:21:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,345 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:21:54,345 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:21:54,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:21:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:21:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:21:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:21:54,349 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:21:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,349 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:21:54,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:21:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:21:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:21:54,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,350 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-09-26 08:21:54,350 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-09-26 08:21:54,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:21:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:21:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:21:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:54,608 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-09-26 08:21:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,686 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:21:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:21:54,686 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-09-26 08:21:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,687 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:21:54,687 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:21:54,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:21:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:21:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:21:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:21:54,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:21:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,690 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:21:54,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:21:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:21:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:21:54,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,690 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-09-26 08:21:54,690 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-09-26 08:21:54,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:21:54,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:21:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:21:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:54,933 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-09-26 08:21:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,007 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:21:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:21:55,007 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-09-26 08:21:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,008 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:21:55,008 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:21:55,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:21:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:21:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:21:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:21:55,012 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:21:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,012 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:21:55,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:21:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:21:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:21:55,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,013 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-09-26 08:21:55,013 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-09-26 08:21:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:55,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:55,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:21:55,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:21:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:21:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:55,248 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-09-26 08:21:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,315 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:21:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:21:55,315 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-09-26 08:21:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,316 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:21:55,316 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:21:55,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:21:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:21:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:21:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:21:55,319 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:21:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,320 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:21:55,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:21:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:21:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:21:55,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,320 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-09-26 08:21:55,321 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-09-26 08:21:55,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:55,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:55,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:21:55,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:21:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:21:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:55,560 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-09-26 08:21:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,624 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:21:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:21:55,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-09-26 08:21:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,625 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:21:55,625 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:21:55,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:21:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:21:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:21:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:21:55,629 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:21:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,629 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:21:55,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:21:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:21:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:21:55,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,630 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-09-26 08:21:55,630 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-09-26 08:21:55,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:57,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:57,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:21:57,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:21:57,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:21:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:57,027 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-09-26 08:21:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,245 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:21:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:21:58,246 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-09-26 08:21:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,247 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:21:58,247 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:21:58,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:21:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:21:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:21:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:21:58,255 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:21:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,256 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:21:58,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:21:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:21:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:21:58,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:58,257 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-09-26 08:21:58,257 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:58,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-09-26 08:21:58,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,820 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:21:58,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-26 08:21:58,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:21:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:21:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:58,822 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-09-26 08:21:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,894 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:21:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:21:58,895 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-09-26 08:21:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,895 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:21:58,895 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:21:58,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:21:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:21:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:21:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:21:58,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-09-26 08:21:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,897 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:21:58,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:21:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:21:58,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:21:58,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:21:59,055 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-09-26 08:21:59,772 WARN L178 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-09-26 08:21:59,786 INFO L422 ceAbstractionStarter]: At program point mainErr0ASSERT_VIOLATIONASSERT(line 29) the Hoare annotation is: false [2018-09-26 08:21:59,786 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 17 31) the Hoare annotation is: true [2018-09-26 08:21:59,786 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 17 31) no Hoare annotation was computed. [2018-09-26 08:21:59,786 INFO L429 ceAbstractionStarter]: At program point mainEXIT(lines 17 31) the Hoare annotation is: true [2018-09-26 08:21:59,806 INFO L422 ceAbstractionStarter]: At program point L24-1(lines 24 27) the Hoare annotation is: (or (and (<= 8 main_y) (<= main_y 8) (<= main_x 8) (<= 8 main_x)) (and (<= main_x 49) (<= main_y 49) (<= 49 main_x) (<= 49 main_y)) (and (<= 99 main_x) (<= main_y 99) (<= 99 main_y) (<= main_x 99)) (and (<= 42 main_x) (<= main_y 42) (<= main_x 42) (<= 42 main_y)) (and (<= 9 main_y) (<= 9 main_x) (<= main_x 9) (<= main_y 9)) (and (<= 59 main_x) (<= 59 main_y) (<= main_y 59) (<= main_x 59)) (and (<= 55 main_y) (<= main_y 55) (<= 55 main_x) (<= main_x 55)) (and (<= main_x 97) (<= 97 main_y) (<= main_y 97) (<= 97 main_x)) (and (<= 74 main_x) (<= main_x 74) (<= 74 main_y) (<= main_y 74)) (and (<= 12 main_x) (<= 12 main_y) (<= main_y 12) (<= main_x 12)) (and (<= main_x 65) (<= main_y 65) (<= 65 main_x) (<= 65 main_y)) (and (<= 32 main_x) (<= main_x 32) (<= 32 main_y) (<= main_y 32)) (and (<= main_y 73) (<= main_x 73) (<= 73 main_x) (<= 73 main_y)) (and (<= 6 main_x) (<= main_x 6) (<= 6 main_y) (<= main_y 6)) (and (<= 14 main_x) (<= 14 main_y) (<= main_y 14) (<= main_x 14)) (and (<= main_x 0) (<= 0 main_y) (<= 0 main_x) (<= main_y 0)) (and (<= main_y 44) (<= main_x 44) (<= 44 main_y) (<= 44 main_x)) (and (<= 38 main_x) (<= 38 main_y) (<= main_y 38) (<= main_x 38)) (and (<= 43 main_x) (<= main_x 43) (<= main_y 43) (<= 43 main_y)) (and (<= 21 main_y) (<= 21 main_x) (<= main_x 21) (<= main_y 21)) (and (<= 94 main_x) (<= 94 main_y) (<= main_x 94) (<= main_y 94)) (and (<= 52 main_x) (<= 52 main_y) (<= main_y 52) (<= main_x 52)) (and (<= main_y 46) (<= 46 main_x) (<= main_x 46) (<= 46 main_y)) (and (<= main_x 18) (<= 18 main_y) (<= 18 main_x) (<= main_y 18)) (<= 101 main_x) (and (<= 61 main_y) (<= main_x 61) (<= main_y 61) (<= 61 main_x)) (and (<= 88 main_y) (<= main_y 88) (<= 88 main_x) (<= main_x 88)) (and (<= 80 main_y) (<= main_x 80) (<= main_y 80) (<= 80 main_x)) (and (<= main_x 92) (<= 92 main_y) (<= main_y 92) (<= 92 main_x)) (and (<= 87 main_x) (<= main_x 87) (<= 87 main_y) (<= main_y 87)) (and (<= 35 main_y) (<= main_y 35) (<= main_x 35) (<= 35 main_x)) (and (<= 85 main_x) (<= main_x 85) (<= 85 main_y) (<= main_y 85)) (and (<= 63 main_x) (<= 63 main_y) (<= main_y 63) (<= main_x 63)) (and (<= 15 main_y) (<= main_y 15) (<= 15 main_x) (<= main_x 15)) (and (<= main_y 64) (<= 64 main_x) (<= main_x 64) (<= 64 main_y)) (and (<= 4 main_y) (<= main_y 4) (<= main_x 4) (<= 4 main_x)) (and (<= 47 main_x) (<= 47 main_y) (<= main_y 47) (<= main_x 47)) (and (<= 51 main_y) (<= main_x 51) (<= 51 main_x) (<= main_y 51)) (and (<= 54 main_y) (<= main_y 54) (<= 54 main_x) (<= main_x 54)) (and (<= main_x 33) (<= 33 main_x) (<= main_y 33) (<= 33 main_y)) (and (<= 37 main_x) (<= 37 main_y) (<= main_y 37) (<= main_x 37)) (and (<= 20 main_y) (<= 20 main_x) (<= main_y 20) (<= main_x 20)) (and (<= 26 main_y) (<= main_x 26) (<= 26 main_x) (<= main_y 26)) (and (<= 86 main_x) (<= 86 main_y) (<= main_x 86) (<= main_y 86)) (and (<= main_x 27) (<= main_y 27) (<= 27 main_y) (<= 27 main_x)) (and (<= main_y 95) (<= 95 main_x) (<= 95 main_y) (<= main_x 95)) (and (<= 1 main_x) (<= main_x 1) (<= main_y 1) (<= 1 main_y)) (and (<= main_x 56) (<= 56 main_x) (<= 56 main_y) (<= main_y 56)) (and (<= main_y 75) (<= main_x 75) (<= 75 main_y) (<= 75 main_x)) (and (<= main_x 62) (<= 62 main_x) (<= 62 main_y) (<= main_y 62)) (and (<= 68 main_y) (<= main_x 68) (<= main_y 68) (<= 68 main_x)) (and (<= main_y 78) (<= 78 main_x) (<= 78 main_y) (<= main_x 78)) (and (<= main_y 3) (<= 3 main_y) (<= 3 main_x) (<= main_x 3)) (and (<= main_x 25) (<= main_y 25) (<= 25 main_x) (<= 25 main_y)) (and (<= main_x 36) (<= main_y 36) (<= 36 main_x) (<= 36 main_y)) (and (<= 57 main_y) (<= main_x 57) (<= main_y 57) (<= 57 main_x)) (and (<= 5 main_x) (<= main_x 5) (<= main_y 5) (<= 5 main_y)) (and (<= 82 main_x) (<= 82 main_y) (<= main_x 82) (<= main_y 82)) (and (<= main_y 17) (<= 17 main_y) (<= 17 main_x) (<= main_x 17)) (and (<= main_y 83) (<= 83 main_x) (<= main_x 83) (<= 83 main_y)) (and (<= 77 main_x) (<= 77 main_y) (<= main_x 77) (<= main_y 77)) (and (<= 31 main_x) (<= 31 main_y) (<= main_y 31) (<= main_x 31)) (and (<= main_y 98) (<= main_x 98) (<= 98 main_y) (<= 98 main_x)) (and (<= 71 main_y) (<= 71 main_x) (<= main_y 71) (<= main_x 71)) (and (<= main_y 41) (<= 41 main_x) (<= 41 main_y) (<= main_x 41)) (and (<= 30 main_x) (<= 30 main_y) (<= main_x 30) (<= main_y 30)) (and (<= 24 main_y) (<= main_x 24) (<= main_y 24) (<= 24 main_x)) (and (<= main_y 50) (<= 50 main_y) (<= main_x 50) (<= 50 main_x)) (and (<= 84 main_y) (<= main_y 84) (<= main_x 84) (<= 84 main_x)) (and (<= main_y 93) (<= 93 main_y) (<= 93 main_x) (<= main_x 93)) (and (<= main_y 60) (<= main_x 60) (<= 60 main_y) (<= 60 main_x)) (and (<= 29 main_y) (<= main_x 29) (<= 29 main_x) (<= main_y 29)) (and (<= main_y 40) (<= main_x 40) (<= 40 main_y) (<= 40 main_x)) (and (<= main_y 53) (<= 53 main_y) (<= main_x 53) (<= 53 main_x)) (and (<= main_y 58) (<= 58 main_y) (<= 58 main_x) (<= main_x 58)) (and (<= 67 main_x) (<= 67 main_y) (<= main_y 67) (<= main_x 67)) (and (<= main_y 22) (<= main_x 22) (<= 22 main_x) (<= 22 main_y)) (and (<= 39 main_y) (<= 39 main_x) (<= main_x 39) (<= main_y 39)) (and (<= 13 main_x) (<= main_x 13) (<= main_y 13) (<= 13 main_y)) (and (<= main_y 79) (<= 79 main_x) (<= main_x 79) (<= 79 main_y)) (and (<= 69 main_x) (<= main_x 69) (<= 69 main_y) (<= main_y 69)) (and (<= 81 main_x) (<= main_y 81) (<= main_x 81) (<= 81 main_y)) (and (<= 28 main_y) (<= main_x 28) (<= 28 main_x) (<= main_y 28)) (and (<= main_x 91) (<= 91 main_y) (<= 91 main_x) (<= main_y 91)) (and (<= main_y 66) (<= main_x 66) (<= 66 main_x) (<= 66 main_y)) (and (<= 34 main_x) (<= main_y 34) (<= main_x 34) (<= 34 main_y)) (and (<= 89 main_x) (<= main_y 89) (<= main_x 89) (<= 89 main_y)) (and (<= 10 main_y) (<= main_x 10) (<= main_y 10) (<= 10 main_x)) (and (<= main_x 16) (<= main_y 16) (<= 16 main_x) (<= 16 main_y)) (and (<= 100 main_x) (<= main_y 100) (< 99 main_y)) (and (<= 2 main_y) (<= 2 main_x) (<= main_y 2) (<= main_x 2)) (and (<= main_x 7) (<= 7 main_y) (<= 7 main_x) (<= main_y 7)) (and (<= main_x 72) (<= 72 main_x) (<= 72 main_y) (<= main_y 72)) (and (<= 48 main_x) (<= main_x 48) (<= main_y 48) (<= 48 main_y)) (and (<= main_y 76) (<= main_x 76) (<= 76 main_y) (<= 76 main_x)) (and (<= 96 main_x) (<= main_y 96) (<= 96 main_y) (<= main_x 96)) (and (<= 45 main_x) (<= 45 main_y) (<= main_y 45) (<= main_x 45)) (and (<= 11 main_x) (<= main_x 11) (<= 11 main_y) (<= main_y 11)) (and (<= 90 main_x) (<= main_y 90) (<= 90 main_y) (<= main_x 90)) (and (<= main_x 19) (<= main_y 19) (<= 19 main_x) (<= 19 main_y)) (and (<= main_x 70) (<= main_y 70) (<= 70 main_x) (<= 70 main_y)) (and (<= 23 main_x) (<= 23 main_y) (<= main_y 23) (<= main_x 23))) [2018-09-26 08:21:59,843 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:21:59 BoogieIcfgContainer [2018-09-26 08:21:59,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:21:59,844 INFO L168 Benchmark]: Toolchain (without parser) took 27471.29 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 977.8 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 276.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:59,845 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-09-26 08:21:59,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.52 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-09-26 08:21:59,846 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 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-09-26 08:21:59,846 INFO L168 Benchmark]: RCFGBuilder took 235.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:21:59,847 INFO L168 Benchmark]: TraceAbstraction took 27154.85 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 977.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 265.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:59,850 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.16 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 47.52 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 26.06 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 235.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27154.85 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 977.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 265.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((8 <= y && y <= 8) && x <= 8) && 8 <= x) || (((x <= 49 && y <= 49) && 49 <= x) && 49 <= y)) || (((99 <= x && y <= 99) && 99 <= y) && x <= 99)) || (((42 <= x && y <= 42) && x <= 42) && 42 <= y)) || (((9 <= y && 9 <= x) && x <= 9) && y <= 9)) || (((59 <= x && 59 <= y) && y <= 59) && x <= 59)) || (((55 <= y && y <= 55) && 55 <= x) && x <= 55)) || (((x <= 97 && 97 <= y) && y <= 97) && 97 <= x)) || (((74 <= x && x <= 74) && 74 <= y) && y <= 74)) || (((12 <= x && 12 <= y) && y <= 12) && x <= 12)) || (((x <= 65 && y <= 65) && 65 <= x) && 65 <= y)) || (((32 <= x && x <= 32) && 32 <= y) && y <= 32)) || (((y <= 73 && x <= 73) && 73 <= x) && 73 <= y)) || (((6 <= x && x <= 6) && 6 <= y) && y <= 6)) || (((14 <= x && 14 <= y) && y <= 14) && x <= 14)) || (((x <= 0 && 0 <= y) && 0 <= x) && y <= 0)) || (((y <= 44 && x <= 44) && 44 <= y) && 44 <= x)) || (((38 <= x && 38 <= y) && y <= 38) && x <= 38)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((21 <= y && 21 <= x) && x <= 21) && y <= 21)) || (((94 <= x && 94 <= y) && x <= 94) && y <= 94)) || (((52 <= x && 52 <= y) && y <= 52) && x <= 52)) || (((y <= 46 && 46 <= x) && x <= 46) && 46 <= y)) || (((x <= 18 && 18 <= y) && 18 <= x) && y <= 18)) || 101 <= x) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((88 <= y && y <= 88) && 88 <= x) && x <= 88)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 92 && 92 <= y) && y <= 92) && 92 <= x)) || (((87 <= x && x <= 87) && 87 <= y) && y <= 87)) || (((35 <= y && y <= 35) && x <= 35) && 35 <= x)) || (((85 <= x && x <= 85) && 85 <= y) && y <= 85)) || (((63 <= x && 63 <= y) && y <= 63) && x <= 63)) || (((15 <= y && y <= 15) && 15 <= x) && x <= 15)) || (((y <= 64 && 64 <= x) && x <= 64) && 64 <= y)) || (((4 <= y && y <= 4) && x <= 4) && 4 <= x)) || (((47 <= x && 47 <= y) && y <= 47) && x <= 47)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((54 <= y && y <= 54) && 54 <= x) && x <= 54)) || (((x <= 33 && 33 <= x) && y <= 33) && 33 <= y)) || (((37 <= x && 37 <= y) && y <= 37) && x <= 37)) || (((20 <= y && 20 <= x) && y <= 20) && x <= 20)) || (((26 <= y && x <= 26) && 26 <= x) && y <= 26)) || (((86 <= x && 86 <= y) && x <= 86) && y <= 86)) || (((x <= 27 && y <= 27) && 27 <= y) && 27 <= x)) || (((y <= 95 && 95 <= x) && 95 <= y) && x <= 95)) || (((1 <= x && x <= 1) && y <= 1) && 1 <= y)) || (((x <= 56 && 56 <= x) && 56 <= y) && y <= 56)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((x <= 62 && 62 <= x) && 62 <= y) && y <= 62)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 3 && 3 <= y) && 3 <= x) && x <= 3)) || (((x <= 25 && y <= 25) && 25 <= x) && 25 <= y)) || (((x <= 36 && y <= 36) && 36 <= x) && 36 <= y)) || (((57 <= y && x <= 57) && y <= 57) && 57 <= x)) || (((5 <= x && x <= 5) && y <= 5) && 5 <= y)) || (((82 <= x && 82 <= y) && x <= 82) && y <= 82)) || (((y <= 17 && 17 <= y) && 17 <= x) && x <= 17)) || (((y <= 83 && 83 <= x) && x <= 83) && 83 <= y)) || (((77 <= x && 77 <= y) && x <= 77) && y <= 77)) || (((31 <= x && 31 <= y) && y <= 31) && x <= 31)) || (((y <= 98 && x <= 98) && 98 <= y) && 98 <= x)) || (((71 <= y && 71 <= x) && y <= 71) && x <= 71)) || (((y <= 41 && 41 <= x) && 41 <= y) && x <= 41)) || (((30 <= x && 30 <= y) && x <= 30) && y <= 30)) || (((24 <= y && x <= 24) && y <= 24) && 24 <= x)) || (((y <= 50 && 50 <= y) && x <= 50) && 50 <= x)) || (((84 <= y && y <= 84) && x <= 84) && 84 <= x)) || (((y <= 93 && 93 <= y) && 93 <= x) && x <= 93)) || (((y <= 60 && x <= 60) && 60 <= y) && 60 <= x)) || (((29 <= y && x <= 29) && 29 <= x) && y <= 29)) || (((y <= 40 && x <= 40) && 40 <= y) && 40 <= x)) || (((y <= 53 && 53 <= y) && x <= 53) && 53 <= x)) || (((y <= 58 && 58 <= y) && 58 <= x) && x <= 58)) || (((67 <= x && 67 <= y) && y <= 67) && x <= 67)) || (((y <= 22 && x <= 22) && 22 <= x) && 22 <= y)) || (((39 <= y && 39 <= x) && x <= 39) && y <= 39)) || (((13 <= x && x <= 13) && y <= 13) && 13 <= y)) || (((y <= 79 && 79 <= x) && x <= 79) && 79 <= y)) || (((69 <= x && x <= 69) && 69 <= y) && y <= 69)) || (((81 <= x && y <= 81) && x <= 81) && 81 <= y)) || (((28 <= y && x <= 28) && 28 <= x) && y <= 28)) || (((x <= 91 && 91 <= y) && 91 <= x) && y <= 91)) || (((y <= 66 && x <= 66) && 66 <= x) && 66 <= y)) || (((34 <= x && y <= 34) && x <= 34) && 34 <= y)) || (((89 <= x && y <= 89) && x <= 89) && 89 <= y)) || (((10 <= y && x <= 10) && y <= 10) && 10 <= x)) || (((x <= 16 && y <= 16) && 16 <= x) && 16 <= y)) || ((100 <= x && y <= 100) && 99 < y)) || (((2 <= y && 2 <= x) && y <= 2) && x <= 2)) || (((x <= 7 && 7 <= y) && 7 <= x) && y <= 7)) || (((x <= 72 && 72 <= x) && 72 <= y) && y <= 72)) || (((48 <= x && x <= 48) && y <= 48) && 48 <= y)) || (((y <= 76 && x <= 76) && 76 <= y) && 76 <= x)) || (((96 <= x && y <= 96) && 96 <= y) && x <= 96)) || (((45 <= x && 45 <= y) && y <= 45) && x <= 45)) || (((11 <= x && x <= 11) && 11 <= y) && y <= 11)) || (((90 <= x && y <= 90) && 90 <= y) && x <= 90)) || (((x <= 19 && y <= 19) && 19 <= x) && 19 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((23 <= x && 23 <= y) && y <= 23) && x <= 23) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 27.0s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 19439 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5253 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 106 NumberOfFragments, 1317 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 5355 NumberOfCodeBlocks, 5355 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 5253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/176851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-21-59-868.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-21-59-868.csv Received shutdown request...