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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:28:09,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:28:09,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:28:09,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:28:09,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:28:09,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:28:09,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:28:09,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:28:09,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:28:09,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:28:09,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:28:09,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:28:09,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:28:09,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:28:09,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:28:09,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:28:09,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:28:09,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:28:09,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:28:09,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:28:09,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:28:09,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:28:09,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:28:09,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:28:09,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:28:09,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:28:09,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:28:09,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:28:09,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:28:09,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:28:09,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:28:09,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:28:09,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:28:09,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:28:09,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:28:09,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:28:09,950 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:28:09,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:28:09,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:28:09,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:28:09,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:28:09,962 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:28:09,962 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:28:09,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:28:09,966 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:28:09,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:28:09,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:28:09,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:28:09,967 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:28:09,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:28:09,968 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:28:09,968 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:28:10,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:28:10,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:28:10,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:28:10,045 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:28:10,045 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:28:10,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_8.bpl [2018-10-10 15:28:10,046 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_8.bpl' [2018-10-10 15:28:10,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:28:10,122 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:28:10,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:28:10,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:28:10,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:28:10,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... [2018-10-10 15:28:10,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:28:10,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:28:10,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:28:10,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:28:10,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:28:10,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:28:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:28:10,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:28:10,663 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:28:10,665 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:28:10 BoogieIcfgContainer [2018-10-10 15:28:10,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:28:10,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:28:10,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:28:10,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:28:10,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:28:10" (1/2) ... [2018-10-10 15:28:10,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5649362 and model type array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:28:10, skipping insertion in model container [2018-10-10 15:28:10,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:28:10" (2/2) ... [2018-10-10 15:28:10,675 INFO L112 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i_8.bpl [2018-10-10 15:28:10,686 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:28:10,697 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:28:10,715 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:28:10,749 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:28:10,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:28:10,750 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:28:10,750 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:28:10,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:28:10,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:28:10,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:28:10,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:28:10,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:28:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-10 15:28:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 15:28:10,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:10,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:10,792 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:10,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -597764646, now seen corresponding path program 1 times [2018-10-10 15:28:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:10,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:28:10,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 15:28:10,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 15:28:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 15:28:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 15:28:11,008 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-10-10 15:28:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:11,091 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-10 15:28:11,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 15:28:11,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-10 15:28:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:11,111 INFO L225 Difference]: With dead ends: 50 [2018-10-10 15:28:11,112 INFO L226 Difference]: Without dead ends: 50 [2018-10-10 15:28:11,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-10 15:28:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-10 15:28:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-10-10 15:28:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-10 15:28:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-10 15:28:11,155 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2018-10-10 15:28:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:11,156 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-10 15:28:11,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 15:28:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-10 15:28:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 15:28:11,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:11,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:11,158 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:11,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash -809791487, now seen corresponding path program 1 times [2018-10-10 15:28:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:11,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:28:11,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:28:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:28:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:28:11,311 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 5 states. [2018-10-10 15:28:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:11,573 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-10 15:28:11,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:28:11,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-10 15:28:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:11,576 INFO L225 Difference]: With dead ends: 64 [2018-10-10 15:28:11,576 INFO L226 Difference]: Without dead ends: 64 [2018-10-10 15:28:11,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:28:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-10 15:28:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-10-10 15:28:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 15:28:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 15:28:11,585 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 37 [2018-10-10 15:28:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:11,586 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 15:28:11,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:28:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 15:28:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 15:28:11,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:11,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:11,589 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:11,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash -843580952, now seen corresponding path program 2 times [2018-10-10 15:28:11,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:11,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:28:11,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:28:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:28:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:28:11,863 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 7 states. [2018-10-10 15:28:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:12,171 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-10 15:28:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:28:12,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-10-10 15:28:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:12,174 INFO L225 Difference]: With dead ends: 78 [2018-10-10 15:28:12,175 INFO L226 Difference]: Without dead ends: 78 [2018-10-10 15:28:12,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:28:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-10 15:28:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-10-10 15:28:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 15:28:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 15:28:12,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 51 [2018-10-10 15:28:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:12,185 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 15:28:12,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:28:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 15:28:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 15:28:12,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:12,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:12,189 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:12,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1236958321, now seen corresponding path program 3 times [2018-10-10 15:28:12,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:12,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:12,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:28:12,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:28:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:28:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:28:12,394 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 9 states. [2018-10-10 15:28:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:12,931 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-10 15:28:12,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:28:12,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-10-10 15:28:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:12,936 INFO L225 Difference]: With dead ends: 92 [2018-10-10 15:28:12,936 INFO L226 Difference]: Without dead ends: 92 [2018-10-10 15:28:12,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:28:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-10 15:28:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2018-10-10 15:28:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 15:28:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 15:28:12,952 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 65 [2018-10-10 15:28:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:12,953 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 15:28:12,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:28:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 15:28:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 15:28:12,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:12,960 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:12,960 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:12,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash 772906230, now seen corresponding path program 4 times [2018-10-10 15:28:12,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:13,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:13,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:28:13,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:28:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:28:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:28:13,356 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 11 states. [2018-10-10 15:28:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:13,673 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-10 15:28:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:28:13,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-10-10 15:28:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:13,675 INFO L225 Difference]: With dead ends: 106 [2018-10-10 15:28:13,676 INFO L226 Difference]: Without dead ends: 106 [2018-10-10 15:28:13,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:28:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-10 15:28:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-10-10 15:28:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 15:28:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 15:28:13,684 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 79 [2018-10-10 15:28:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:13,685 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 15:28:13,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:28:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 15:28:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 15:28:13,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:13,687 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:13,687 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1517963747, now seen corresponding path program 5 times [2018-10-10 15:28:13,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:13,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:13,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:28:13,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:28:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:28:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:28:13,919 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 13 states. [2018-10-10 15:28:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:14,221 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-10 15:28:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:28:14,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-10-10 15:28:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:14,226 INFO L225 Difference]: With dead ends: 120 [2018-10-10 15:28:14,226 INFO L226 Difference]: Without dead ends: 120 [2018-10-10 15:28:14,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:28:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-10 15:28:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2018-10-10 15:28:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:28:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:28:14,235 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 93 [2018-10-10 15:28:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:14,236 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:28:14,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:28:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:28:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:28:14,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:14,238 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:14,239 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:14,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash 533151492, now seen corresponding path program 6 times [2018-10-10 15:28:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:14,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:28:14,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:28:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:28:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:28:14,634 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 15 states. [2018-10-10 15:28:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:15,003 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-10 15:28:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:28:15,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2018-10-10 15:28:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:15,006 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:28:15,006 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:28:15,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:28:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:28:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2018-10-10 15:28:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 15:28:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 15:28:15,016 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 107 [2018-10-10 15:28:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:15,016 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 15:28:15,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:28:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 15:28:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 15:28:15,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:15,019 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:15,020 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:15,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1179146325, now seen corresponding path program 7 times [2018-10-10 15:28:15,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:15,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:15,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:28:15,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:28:15,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:28:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:28:15,323 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 17 states. [2018-10-10 15:28:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:15,773 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-10 15:28:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:28:15,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-10-10 15:28:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:15,775 INFO L225 Difference]: With dead ends: 148 [2018-10-10 15:28:15,776 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 15:28:15,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:28:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 15:28:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2018-10-10 15:28:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 15:28:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-10 15:28:15,785 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 121 [2018-10-10 15:28:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:15,785 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-10 15:28:15,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:28:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-10 15:28:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 15:28:15,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:15,788 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:15,788 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:15,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash -252420078, now seen corresponding path program 8 times [2018-10-10 15:28:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:16,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:28:16,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:28:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:28:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:28:16,109 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 19 states. [2018-10-10 15:28:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:16,715 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-10 15:28:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:28:16,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 135 [2018-10-10 15:28:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:16,717 INFO L225 Difference]: With dead ends: 162 [2018-10-10 15:28:16,717 INFO L226 Difference]: Without dead ends: 162 [2018-10-10 15:28:16,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:28:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-10 15:28:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2018-10-10 15:28:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:28:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:28:16,726 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 135 [2018-10-10 15:28:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:16,726 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:28:16,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:28:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:28:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:28:16,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:16,729 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:16,729 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:16,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1428760519, now seen corresponding path program 9 times [2018-10-10 15:28:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:17,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:17,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:28:17,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:28:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:28:17,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:28:17,563 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 21 states. [2018-10-10 15:28:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:17,944 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:28:17,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:28:17,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 149 [2018-10-10 15:28:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:17,946 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:28:17,947 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:28:17,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:28:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:28:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2018-10-10 15:28:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 15:28:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-10 15:28:17,954 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 149 [2018-10-10 15:28:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:17,955 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-10 15:28:17,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:28:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-10 15:28:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 15:28:17,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:17,959 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:17,960 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:17,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -76251104, now seen corresponding path program 10 times [2018-10-10 15:28:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:18,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:18,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:28:18,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:28:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:28:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:28:18,457 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 23 states. [2018-10-10 15:28:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:18,908 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-10 15:28:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:28:18,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 163 [2018-10-10 15:28:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:18,909 INFO L225 Difference]: With dead ends: 190 [2018-10-10 15:28:18,909 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 15:28:18,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:28:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 15:28:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2018-10-10 15:28:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 15:28:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-10 15:28:18,916 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 163 [2018-10-10 15:28:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:18,917 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-10 15:28:18,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:28:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-10 15:28:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 15:28:18,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:18,919 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:18,919 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:18,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:18,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1398880313, now seen corresponding path program 11 times [2018-10-10 15:28:18,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:19,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:28:19,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:28:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:28:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:28:19,363 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 25 states. [2018-10-10 15:28:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:19,936 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-10 15:28:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:28:19,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2018-10-10 15:28:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:19,939 INFO L225 Difference]: With dead ends: 204 [2018-10-10 15:28:19,939 INFO L226 Difference]: Without dead ends: 204 [2018-10-10 15:28:19,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:28:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-10 15:28:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2018-10-10 15:28:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:28:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:28:19,945 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 177 [2018-10-10 15:28:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:19,946 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:28:19,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:28:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:28:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:28:19,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:19,947 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:19,948 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:19,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2065490130, now seen corresponding path program 12 times [2018-10-10 15:28:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:20,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:20,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:28:20,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:28:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:28:20,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:28:20,480 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 27 states. [2018-10-10 15:28:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:21,027 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:28:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:28:21,028 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 191 [2018-10-10 15:28:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:21,030 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:28:21,030 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:28:21,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:28:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:28:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2018-10-10 15:28:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 15:28:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-10 15:28:21,037 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 191 [2018-10-10 15:28:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:21,038 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-10 15:28:21,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:28:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-10 15:28:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-10 15:28:21,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:21,040 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:21,040 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:21,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1317729877, now seen corresponding path program 13 times [2018-10-10 15:28:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:21,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:21,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:28:21,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:28:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:28:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:28:21,618 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 29 states. [2018-10-10 15:28:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:22,523 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-10 15:28:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:28:22,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-10-10 15:28:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:22,528 INFO L225 Difference]: With dead ends: 232 [2018-10-10 15:28:22,528 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 15:28:22,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:28:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 15:28:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 220. [2018-10-10 15:28:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 15:28:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-10 15:28:22,533 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 205 [2018-10-10 15:28:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:22,534 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-10 15:28:22,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:28:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-10 15:28:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-10 15:28:22,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:22,535 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:22,536 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:22,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1633960644, now seen corresponding path program 14 times [2018-10-10 15:28:22,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:28:23,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:28:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:28:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:28:23,544 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 31 states. [2018-10-10 15:28:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:24,177 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-10 15:28:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:28:24,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 219 [2018-10-10 15:28:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:24,180 INFO L225 Difference]: With dead ends: 246 [2018-10-10 15:28:24,180 INFO L226 Difference]: Without dead ends: 246 [2018-10-10 15:28:24,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:28:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-10 15:28:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 234. [2018-10-10 15:28:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:28:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:28:24,187 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 219 [2018-10-10 15:28:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:24,188 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:28:24,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:28:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:28:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:28:24,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:24,189 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:24,190 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:24,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1540809699, now seen corresponding path program 15 times [2018-10-10 15:28:24,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:24,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:24,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:28:24,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:28:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:28:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:28:24,817 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 33 states. [2018-10-10 15:28:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:25,568 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-10 15:28:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:28:25,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 233 [2018-10-10 15:28:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:25,572 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:28:25,572 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:28:25,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:28:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:28:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 248. [2018-10-10 15:28:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 15:28:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-10 15:28:25,577 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 233 [2018-10-10 15:28:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:25,578 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-10 15:28:25,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:28:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-10 15:28:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-10 15:28:25,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:25,580 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:25,580 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:25,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash 96066122, now seen corresponding path program 16 times [2018-10-10 15:28:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1696 backedges. 0 proven. 1696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:26,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:26,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:28:26,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:28:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:28:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:28:26,096 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 35 states. [2018-10-10 15:28:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:26,859 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-10 15:28:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:28:26,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 247 [2018-10-10 15:28:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:26,862 INFO L225 Difference]: With dead ends: 274 [2018-10-10 15:28:26,863 INFO L226 Difference]: Without dead ends: 274 [2018-10-10 15:28:26,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:28:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-10 15:28:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2018-10-10 15:28:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 15:28:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-10 15:28:26,869 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 247 [2018-10-10 15:28:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:26,870 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-10 15:28:26,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:28:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-10 15:28:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-10 15:28:26,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:26,872 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:26,872 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:26,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1149366159, now seen corresponding path program 17 times [2018-10-10 15:28:26,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 1921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:27,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:27,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:28:27,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:28:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:28:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:28:27,807 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 37 states. [2018-10-10 15:28:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:29,167 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-10 15:28:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:28:29,168 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 261 [2018-10-10 15:28:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:29,171 INFO L225 Difference]: With dead ends: 288 [2018-10-10 15:28:29,171 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 15:28:29,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:28:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 15:28:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 276. [2018-10-10 15:28:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:28:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-10 15:28:29,178 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 261 [2018-10-10 15:28:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:29,179 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-10 15:28:29,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:28:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-10 15:28:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:28:29,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:29,180 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:29,181 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:29,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 51967576, now seen corresponding path program 18 times [2018-10-10 15:28:29,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:30,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:30,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:28:30,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:28:30,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:28:30,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:28:30,130 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 39 states. [2018-10-10 15:28:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:31,022 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-10 15:28:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:28:31,022 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 275 [2018-10-10 15:28:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:31,025 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:28:31,025 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:28:31,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:28:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:28:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2018-10-10 15:28:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-10 15:28:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-10 15:28:31,033 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 275 [2018-10-10 15:28:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:31,034 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-10 15:28:31,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:28:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-10 15:28:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-10 15:28:31,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:31,036 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:31,036 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:31,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1346108415, now seen corresponding path program 19 times [2018-10-10 15:28:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2413 backedges. 0 proven. 2413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:32,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:32,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:28:32,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:28:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:28:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:28:32,284 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 41 states. [2018-10-10 15:28:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:34,146 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-10 15:28:34,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:28:34,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 289 [2018-10-10 15:28:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:34,150 INFO L225 Difference]: With dead ends: 316 [2018-10-10 15:28:34,150 INFO L226 Difference]: Without dead ends: 316 [2018-10-10 15:28:34,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:28:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-10 15:28:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 304. [2018-10-10 15:28:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-10 15:28:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-10 15:28:34,157 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 289 [2018-10-10 15:28:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:34,158 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-10 15:28:34,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:28:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-10 15:28:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-10 15:28:34,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:34,160 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:34,160 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:34,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1263833446, now seen corresponding path program 20 times [2018-10-10 15:28:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 0 proven. 2680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:28:36,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:28:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:28:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:28:36,024 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 43 states. [2018-10-10 15:28:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:37,115 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-10 15:28:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:28:37,116 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 303 [2018-10-10 15:28:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:37,119 INFO L225 Difference]: With dead ends: 330 [2018-10-10 15:28:37,119 INFO L226 Difference]: Without dead ends: 330 [2018-10-10 15:28:37,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:28:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-10 15:28:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 318. [2018-10-10 15:28:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:28:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-10 15:28:37,127 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 303 [2018-10-10 15:28:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:37,128 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-10 15:28:37,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:28:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-10 15:28:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-10 15:28:37,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:37,130 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:37,130 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:37,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -661903731, now seen corresponding path program 21 times [2018-10-10 15:28:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 0 proven. 2961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:40,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:40,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:28:40,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:28:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:28:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:28:40,982 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 45 states. [2018-10-10 15:28:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:42,336 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-10 15:28:42,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:28:42,343 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 317 [2018-10-10 15:28:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:42,345 INFO L225 Difference]: With dead ends: 344 [2018-10-10 15:28:42,345 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 15:28:42,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:28:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 15:28:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 332. [2018-10-10 15:28:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-10 15:28:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-10 15:28:42,351 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 317 [2018-10-10 15:28:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:42,351 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-10 15:28:42,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:28:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-10 15:28:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-10 15:28:42,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:42,353 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:42,353 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:42,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash -557307020, now seen corresponding path program 22 times [2018-10-10 15:28:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:43,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:43,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:28:43,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:28:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:28:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:28:43,879 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 47 states. [2018-10-10 15:28:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:45,260 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-10 15:28:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:28:45,260 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 331 [2018-10-10 15:28:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:45,262 INFO L225 Difference]: With dead ends: 358 [2018-10-10 15:28:45,262 INFO L226 Difference]: Without dead ends: 358 [2018-10-10 15:28:45,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:28:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-10 15:28:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 346. [2018-10-10 15:28:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 15:28:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-10 15:28:45,268 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 331 [2018-10-10 15:28:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:45,269 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-10 15:28:45,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:28:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-10 15:28:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-10 15:28:45,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:45,271 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:45,271 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:45,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -827715557, now seen corresponding path program 23 times [2018-10-10 15:28:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3565 backedges. 0 proven. 3565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:47,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:47,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:28:47,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:28:47,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:28:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:28:47,191 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 49 states. [2018-10-10 15:28:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:48,527 INFO L93 Difference]: Finished difference Result 372 states and 372 transitions. [2018-10-10 15:28:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:28:48,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 345 [2018-10-10 15:28:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:48,530 INFO L225 Difference]: With dead ends: 372 [2018-10-10 15:28:48,530 INFO L226 Difference]: Without dead ends: 372 [2018-10-10 15:28:48,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:28:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-10 15:28:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 360. [2018-10-10 15:28:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-10 15:28:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-10 15:28:48,537 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 345 [2018-10-10 15:28:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:48,537 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-10 15:28:48,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:28:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-10 15:28:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-10 15:28:48,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:48,539 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:48,540 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:48,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash -376486782, now seen corresponding path program 24 times [2018-10-10 15:28:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:28:49,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:28:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:28:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:28:49,776 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 51 states. [2018-10-10 15:28:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:51,148 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-10 15:28:51,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:28:51,148 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 359 [2018-10-10 15:28:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:51,151 INFO L225 Difference]: With dead ends: 386 [2018-10-10 15:28:51,151 INFO L226 Difference]: Without dead ends: 386 [2018-10-10 15:28:51,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:28:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-10 15:28:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2018-10-10 15:28:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-10 15:28:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-10-10 15:28:51,159 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 359 [2018-10-10 15:28:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:51,160 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-10-10 15:28:51,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:28:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-10-10 15:28:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-10 15:28:51,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:51,163 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:51,164 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:51,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1217476777, now seen corresponding path program 25 times [2018-10-10 15:28:51,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:52,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:52,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:28:52,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:28:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:28:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:28:52,587 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 53 states. [2018-10-10 15:28:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:54,328 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-10 15:28:54,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:28:54,328 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2018-10-10 15:28:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:54,331 INFO L225 Difference]: With dead ends: 400 [2018-10-10 15:28:54,332 INFO L226 Difference]: Without dead ends: 400 [2018-10-10 15:28:54,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:28:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-10 15:28:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 388. [2018-10-10 15:28:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-10 15:28:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-10-10 15:28:54,339 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 373 [2018-10-10 15:28:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:54,340 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-10-10 15:28:54,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:28:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-10-10 15:28:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-10 15:28:54,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:54,342 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:54,342 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:54,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1551541104, now seen corresponding path program 26 times [2018-10-10 15:28:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4576 backedges. 0 proven. 4576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:55,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:55,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:28:55,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:28:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:28:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:28:55,698 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 55 states. [2018-10-10 15:28:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:57,576 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-10-10 15:28:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:28:57,577 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 387 [2018-10-10 15:28:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:57,580 INFO L225 Difference]: With dead ends: 414 [2018-10-10 15:28:57,580 INFO L226 Difference]: Without dead ends: 414 [2018-10-10 15:28:57,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:28:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-10 15:28:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 402. [2018-10-10 15:28:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-10 15:28:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-10-10 15:28:57,586 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 387 [2018-10-10 15:28:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:57,587 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-10-10 15:28:57,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:28:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-10-10 15:28:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-10 15:28:57,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:57,589 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:57,589 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:57,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash -671277001, now seen corresponding path program 27 times [2018-10-10 15:28:57,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4941 backedges. 0 proven. 4941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:28:58,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:28:58,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:28:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:28:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:28:58,899 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 57 states. [2018-10-10 15:29:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:00,934 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-10 15:29:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:29:00,935 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 401 [2018-10-10 15:29:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:00,938 INFO L225 Difference]: With dead ends: 428 [2018-10-10 15:29:00,939 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 15:29:00,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:29:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 15:29:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 416. [2018-10-10 15:29:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-10 15:29:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-10 15:29:00,945 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 401 [2018-10-10 15:29:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:00,946 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-10 15:29:00,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:29:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-10 15:29:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-10 15:29:00,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:00,949 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:00,949 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:00,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 809890718, now seen corresponding path program 28 times [2018-10-10 15:29:00,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5320 backedges. 0 proven. 5320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:02,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:29:02,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:29:02,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:29:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:29:02,218 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 59 states. [2018-10-10 15:29:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:05,197 INFO L93 Difference]: Finished difference Result 442 states and 442 transitions. [2018-10-10 15:29:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:29:05,197 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 415 [2018-10-10 15:29:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:05,200 INFO L225 Difference]: With dead ends: 442 [2018-10-10 15:29:05,200 INFO L226 Difference]: Without dead ends: 442 [2018-10-10 15:29:05,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:29:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-10 15:29:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 430. [2018-10-10 15:29:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 15:29:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-10 15:29:05,207 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 415 [2018-10-10 15:29:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:05,207 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-10 15:29:05,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:29:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-10 15:29:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-10 15:29:05,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:05,210 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:05,211 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:05,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1785284293, now seen corresponding path program 29 times [2018-10-10 15:29:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5713 backedges. 0 proven. 5713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:29:06,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:29:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:29:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:29:06,512 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 61 states. [2018-10-10 15:29:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:08,476 INFO L93 Difference]: Finished difference Result 456 states and 456 transitions. [2018-10-10 15:29:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:29:08,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 429 [2018-10-10 15:29:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:08,479 INFO L225 Difference]: With dead ends: 456 [2018-10-10 15:29:08,479 INFO L226 Difference]: Without dead ends: 456 [2018-10-10 15:29:08,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 15:29:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-10 15:29:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 444. [2018-10-10 15:29:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-10 15:29:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 444 transitions. [2018-10-10 15:29:08,486 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 444 transitions. Word has length 429 [2018-10-10 15:29:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:08,486 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 444 transitions. [2018-10-10 15:29:08,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:29:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 444 transitions. [2018-10-10 15:29:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-10 15:29:08,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:08,489 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:08,490 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:08,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2133625260, now seen corresponding path program 30 times [2018-10-10 15:29:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6120 backedges. 0 proven. 6120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:10,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:10,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:29:10,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:29:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:29:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:29:10,499 INFO L87 Difference]: Start difference. First operand 444 states and 444 transitions. Second operand 63 states. [2018-10-10 15:29:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:12,644 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-10-10 15:29:12,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:29:12,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 443 [2018-10-10 15:29:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:12,646 INFO L225 Difference]: With dead ends: 470 [2018-10-10 15:29:12,646 INFO L226 Difference]: Without dead ends: 470 [2018-10-10 15:29:12,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 15:29:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-10 15:29:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2018-10-10 15:29:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-10 15:29:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-10-10 15:29:12,654 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 443 [2018-10-10 15:29:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:12,654 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-10-10 15:29:12,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:29:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-10-10 15:29:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-10 15:29:12,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:12,657 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:12,658 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:12,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 688991315, now seen corresponding path program 31 times [2018-10-10 15:29:12,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6541 backedges. 0 proven. 6541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:14,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:14,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:29:14,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:29:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:29:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:29:14,272 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 65 states. [2018-10-10 15:29:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:16,710 INFO L93 Difference]: Finished difference Result 484 states and 484 transitions. [2018-10-10 15:29:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:29:16,711 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 457 [2018-10-10 15:29:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:16,712 INFO L225 Difference]: With dead ends: 484 [2018-10-10 15:29:16,712 INFO L226 Difference]: Without dead ends: 484 [2018-10-10 15:29:16,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:29:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-10 15:29:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 472. [2018-10-10 15:29:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-10 15:29:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 472 transitions. [2018-10-10 15:29:16,720 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 472 transitions. Word has length 457 [2018-10-10 15:29:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:16,721 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 472 transitions. [2018-10-10 15:29:16,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:29:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 472 transitions. [2018-10-10 15:29:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-10 15:29:16,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:16,724 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:16,724 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:16,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash 726965946, now seen corresponding path program 32 times [2018-10-10 15:29:16,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6976 backedges. 0 proven. 6976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:18,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:18,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:29:18,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:29:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:29:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:29:18,372 INFO L87 Difference]: Start difference. First operand 472 states and 472 transitions. Second operand 67 states. [2018-10-10 15:29:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:21,037 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-10-10 15:29:21,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 15:29:21,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 471 [2018-10-10 15:29:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:21,039 INFO L225 Difference]: With dead ends: 498 [2018-10-10 15:29:21,039 INFO L226 Difference]: Without dead ends: 498 [2018-10-10 15:29:21,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 15:29:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-10 15:29:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 486. [2018-10-10 15:29:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-10-10 15:29:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2018-10-10 15:29:21,046 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 471 [2018-10-10 15:29:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:21,046 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2018-10-10 15:29:21,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:29:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2018-10-10 15:29:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-10 15:29:21,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:21,050 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:21,050 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:21,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1492144353, now seen corresponding path program 33 times [2018-10-10 15:29:21,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 0 proven. 7425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:23,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:29:23,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:29:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:29:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:29:23,695 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 69 states. [2018-10-10 15:29:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:26,459 INFO L93 Difference]: Finished difference Result 512 states and 512 transitions. [2018-10-10 15:29:26,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 15:29:26,460 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 485 [2018-10-10 15:29:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:26,462 INFO L225 Difference]: With dead ends: 512 [2018-10-10 15:29:26,462 INFO L226 Difference]: Without dead ends: 512 [2018-10-10 15:29:26,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 15:29:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-10 15:29:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 500. [2018-10-10 15:29:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-10 15:29:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-10-10 15:29:26,468 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 485 [2018-10-10 15:29:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:26,469 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-10-10 15:29:26,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:29:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-10-10 15:29:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-10 15:29:26,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:26,472 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:26,472 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:26,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1536799432, now seen corresponding path program 34 times [2018-10-10 15:29:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7888 backedges. 0 proven. 7888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:28,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:28,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:29:28,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:29:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:29:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:29:28,291 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 71 states. [2018-10-10 15:29:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:31,281 INFO L93 Difference]: Finished difference Result 526 states and 526 transitions. [2018-10-10 15:29:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 15:29:31,282 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 499 [2018-10-10 15:29:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:31,285 INFO L225 Difference]: With dead ends: 526 [2018-10-10 15:29:31,285 INFO L226 Difference]: Without dead ends: 526 [2018-10-10 15:29:31,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:29:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-10-10 15:29:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 514. [2018-10-10 15:29:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-10-10 15:29:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 514 transitions. [2018-10-10 15:29:31,291 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 514 transitions. Word has length 499 [2018-10-10 15:29:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:31,292 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 514 transitions. [2018-10-10 15:29:31,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:29:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 514 transitions. [2018-10-10 15:29:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-10-10 15:29:31,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:31,295 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:31,296 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:31,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 985805935, now seen corresponding path program 35 times [2018-10-10 15:29:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8365 backedges. 0 proven. 8365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:33,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:33,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:29:33,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:29:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:29:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:29:33,353 INFO L87 Difference]: Start difference. First operand 514 states and 514 transitions. Second operand 73 states. [2018-10-10 15:29:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:36,558 INFO L93 Difference]: Finished difference Result 540 states and 540 transitions. [2018-10-10 15:29:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-10 15:29:36,558 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 513 [2018-10-10 15:29:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:36,560 INFO L225 Difference]: With dead ends: 540 [2018-10-10 15:29:36,560 INFO L226 Difference]: Without dead ends: 540 [2018-10-10 15:29:36,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 15:29:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-10 15:29:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 528. [2018-10-10 15:29:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-10 15:29:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 528 transitions. [2018-10-10 15:29:36,567 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 528 transitions. Word has length 513 [2018-10-10 15:29:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:36,568 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 528 transitions. [2018-10-10 15:29:36,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:29:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 528 transitions. [2018-10-10 15:29:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-10 15:29:36,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:36,571 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:36,571 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:36,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1567144490, now seen corresponding path program 36 times [2018-10-10 15:29:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8856 backedges. 0 proven. 8856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:38,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:29:38,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:29:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:29:38,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:29:38,382 INFO L87 Difference]: Start difference. First operand 528 states and 528 transitions. Second operand 75 states. [2018-10-10 15:29:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:41,830 INFO L93 Difference]: Finished difference Result 554 states and 554 transitions. [2018-10-10 15:29:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 15:29:41,831 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 527 [2018-10-10 15:29:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:41,833 INFO L225 Difference]: With dead ends: 554 [2018-10-10 15:29:41,833 INFO L226 Difference]: Without dead ends: 554 [2018-10-10 15:29:41,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:29:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-10 15:29:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 542. [2018-10-10 15:29:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-10 15:29:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 542 transitions. [2018-10-10 15:29:41,839 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 542 transitions. Word has length 527 [2018-10-10 15:29:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:41,840 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 542 transitions. [2018-10-10 15:29:41,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:29:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 542 transitions. [2018-10-10 15:29:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-10 15:29:41,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:41,844 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:41,844 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:41,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash -352168195, now seen corresponding path program 37 times [2018-10-10 15:29:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9361 backedges. 0 proven. 9361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:44,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:44,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:29:44,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:29:44,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:29:44,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:29:44,161 INFO L87 Difference]: Start difference. First operand 542 states and 542 transitions. Second operand 77 states. [2018-10-10 15:29:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:47,412 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2018-10-10 15:29:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-10 15:29:47,418 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 541 [2018-10-10 15:29:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:47,421 INFO L225 Difference]: With dead ends: 568 [2018-10-10 15:29:47,421 INFO L226 Difference]: Without dead ends: 568 [2018-10-10 15:29:47,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 15:29:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-10 15:29:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2018-10-10 15:29:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-10-10 15:29:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 556 transitions. [2018-10-10 15:29:47,428 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 556 transitions. Word has length 541 [2018-10-10 15:29:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:47,429 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 556 transitions. [2018-10-10 15:29:47,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:29:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 556 transitions. [2018-10-10 15:29:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-10-10 15:29:47,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:47,433 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:47,433 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:47,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -559360028, now seen corresponding path program 38 times [2018-10-10 15:29:47,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9880 backedges. 0 proven. 9880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:50,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:50,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:29:50,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:29:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:29:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:29:50,271 INFO L87 Difference]: Start difference. First operand 556 states and 556 transitions. Second operand 79 states. [2018-10-10 15:29:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:53,647 INFO L93 Difference]: Finished difference Result 582 states and 582 transitions. [2018-10-10 15:29:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-10 15:29:53,647 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 555 [2018-10-10 15:29:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:53,650 INFO L225 Difference]: With dead ends: 582 [2018-10-10 15:29:53,650 INFO L226 Difference]: Without dead ends: 582 [2018-10-10 15:29:53,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-10 15:29:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-10 15:29:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 570. [2018-10-10 15:29:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-10 15:29:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 570 transitions. [2018-10-10 15:29:53,657 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 570 transitions. Word has length 555 [2018-10-10 15:29:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:53,657 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 570 transitions. [2018-10-10 15:29:53,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:29:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 570 transitions. [2018-10-10 15:29:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-10 15:29:53,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:53,661 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:53,662 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:53,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1106000011, now seen corresponding path program 39 times [2018-10-10 15:29:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10413 backedges. 0 proven. 10413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:29:56,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:56,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:29:56,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:29:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:29:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:29:56,227 INFO L87 Difference]: Start difference. First operand 570 states and 570 transitions. Second operand 81 states. [2018-10-10 15:29:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:59,552 INFO L93 Difference]: Finished difference Result 596 states and 596 transitions. [2018-10-10 15:29:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 15:29:59,558 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 569 [2018-10-10 15:29:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:59,560 INFO L225 Difference]: With dead ends: 596 [2018-10-10 15:29:59,560 INFO L226 Difference]: Without dead ends: 596 [2018-10-10 15:29:59,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-10 15:29:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-10 15:29:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 584. [2018-10-10 15:29:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-10-10 15:29:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 584 transitions. [2018-10-10 15:29:59,566 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 584 transitions. Word has length 569 [2018-10-10 15:29:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:59,567 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 584 transitions. [2018-10-10 15:29:59,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:29:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 584 transitions. [2018-10-10 15:29:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-10-10 15:29:59,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:59,570 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:59,570 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:59,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 434759922, now seen corresponding path program 40 times [2018-10-10 15:29:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10960 backedges. 0 proven. 10960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:02,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:02,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:30:02,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:30:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:30:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:30:02,404 INFO L87 Difference]: Start difference. First operand 584 states and 584 transitions. Second operand 83 states. [2018-10-10 15:30:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:06,313 INFO L93 Difference]: Finished difference Result 610 states and 610 transitions. [2018-10-10 15:30:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-10 15:30:06,313 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 583 [2018-10-10 15:30:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:06,315 INFO L225 Difference]: With dead ends: 610 [2018-10-10 15:30:06,316 INFO L226 Difference]: Without dead ends: 610 [2018-10-10 15:30:06,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 15:30:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-10 15:30:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 598. [2018-10-10 15:30:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-10-10 15:30:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 598 transitions. [2018-10-10 15:30:06,321 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 598 transitions. Word has length 583 [2018-10-10 15:30:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:06,322 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 598 transitions. [2018-10-10 15:30:06,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:30:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 598 transitions. [2018-10-10 15:30:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-10-10 15:30:06,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:06,326 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:06,326 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:06,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1283761895, now seen corresponding path program 41 times [2018-10-10 15:30:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11521 backedges. 0 proven. 11521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:30:08,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:30:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:30:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:30:08,607 INFO L87 Difference]: Start difference. First operand 598 states and 598 transitions. Second operand 85 states. [2018-10-10 15:30:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:12,603 INFO L93 Difference]: Finished difference Result 624 states and 624 transitions. [2018-10-10 15:30:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 15:30:12,603 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 597 [2018-10-10 15:30:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:12,606 INFO L225 Difference]: With dead ends: 624 [2018-10-10 15:30:12,606 INFO L226 Difference]: Without dead ends: 624 [2018-10-10 15:30:12,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 15:30:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-10 15:30:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 612. [2018-10-10 15:30:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-10 15:30:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 612 transitions. [2018-10-10 15:30:12,613 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 612 transitions. Word has length 597 [2018-10-10 15:30:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:12,613 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 612 transitions. [2018-10-10 15:30:12,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:30:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 612 transitions. [2018-10-10 15:30:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2018-10-10 15:30:12,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:12,618 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:12,618 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:12,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1781922048, now seen corresponding path program 42 times [2018-10-10 15:30:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12096 backedges. 0 proven. 12096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:15,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:15,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:30:15,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:30:15,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:30:15,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:30:15,062 INFO L87 Difference]: Start difference. First operand 612 states and 612 transitions. Second operand 87 states. [2018-10-10 15:30:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:19,381 INFO L93 Difference]: Finished difference Result 638 states and 638 transitions. [2018-10-10 15:30:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-10 15:30:19,382 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 611 [2018-10-10 15:30:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:19,384 INFO L225 Difference]: With dead ends: 638 [2018-10-10 15:30:19,384 INFO L226 Difference]: Without dead ends: 638 [2018-10-10 15:30:19,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-10 15:30:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-10 15:30:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 626. [2018-10-10 15:30:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-10 15:30:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 626 transitions. [2018-10-10 15:30:19,390 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 626 transitions. Word has length 611 [2018-10-10 15:30:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:19,391 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 626 transitions. [2018-10-10 15:30:19,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:30:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 626 transitions. [2018-10-10 15:30:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-10 15:30:19,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:19,395 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:19,395 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:19,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 795556007, now seen corresponding path program 43 times [2018-10-10 15:30:19,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12685 backedges. 0 proven. 12685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:22,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:22,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:30:22,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:30:22,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:30:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:30:22,144 INFO L87 Difference]: Start difference. First operand 626 states and 626 transitions. Second operand 89 states. [2018-10-10 15:30:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:26,415 INFO L93 Difference]: Finished difference Result 652 states and 652 transitions. [2018-10-10 15:30:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 15:30:26,415 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 625 [2018-10-10 15:30:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:26,418 INFO L225 Difference]: With dead ends: 652 [2018-10-10 15:30:26,418 INFO L226 Difference]: Without dead ends: 652 [2018-10-10 15:30:26,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 15:30:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-10-10 15:30:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-10-10 15:30:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-10 15:30:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 640 transitions. [2018-10-10 15:30:26,424 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 640 transitions. Word has length 625 [2018-10-10 15:30:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:26,425 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 640 transitions. [2018-10-10 15:30:26,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:30:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 640 transitions. [2018-10-10 15:30:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-10 15:30:26,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:26,428 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:26,428 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:26,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash -785872882, now seen corresponding path program 44 times [2018-10-10 15:30:26,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13288 backedges. 0 proven. 13288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:29,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:29,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:30:29,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:30:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:30:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:30:29,122 INFO L87 Difference]: Start difference. First operand 640 states and 640 transitions. Second operand 91 states. [2018-10-10 15:30:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:33,618 INFO L93 Difference]: Finished difference Result 666 states and 666 transitions. [2018-10-10 15:30:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-10 15:30:33,618 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 639 [2018-10-10 15:30:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:33,621 INFO L225 Difference]: With dead ends: 666 [2018-10-10 15:30:33,621 INFO L226 Difference]: Without dead ends: 666 [2018-10-10 15:30:33,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 15:30:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-10 15:30:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 654. [2018-10-10 15:30:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-10 15:30:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 654 transitions. [2018-10-10 15:30:33,627 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 654 transitions. Word has length 639 [2018-10-10 15:30:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:33,627 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 654 transitions. [2018-10-10 15:30:33,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:30:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 654 transitions. [2018-10-10 15:30:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-10 15:30:33,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:33,631 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:33,631 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:33,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash 20404021, now seen corresponding path program 45 times [2018-10-10 15:30:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13905 backedges. 0 proven. 13905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:36,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:36,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:30:36,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:30:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:30:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:30:36,334 INFO L87 Difference]: Start difference. First operand 654 states and 654 transitions. Second operand 93 states. [2018-10-10 15:30:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:40,623 INFO L93 Difference]: Finished difference Result 680 states and 680 transitions. [2018-10-10 15:30:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-10 15:30:40,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 653 [2018-10-10 15:30:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:40,627 INFO L225 Difference]: With dead ends: 680 [2018-10-10 15:30:40,627 INFO L226 Difference]: Without dead ends: 680 [2018-10-10 15:30:40,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-10 15:30:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-10 15:30:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 668. [2018-10-10 15:30:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-10 15:30:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2018-10-10 15:30:40,632 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 653 [2018-10-10 15:30:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:40,633 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2018-10-10 15:30:40,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:30:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2018-10-10 15:30:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-10 15:30:40,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:40,636 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:40,636 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:40,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash 471668252, now seen corresponding path program 46 times [2018-10-10 15:30:40,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14536 backedges. 0 proven. 14536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:43,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:43,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:30:43,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:30:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:30:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:30:43,735 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand 95 states. [2018-10-10 15:30:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:48,646 INFO L93 Difference]: Finished difference Result 694 states and 694 transitions. [2018-10-10 15:30:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-10 15:30:48,646 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 667 [2018-10-10 15:30:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:48,649 INFO L225 Difference]: With dead ends: 694 [2018-10-10 15:30:48,649 INFO L226 Difference]: Without dead ends: 694 [2018-10-10 15:30:48,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-10 15:30:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-10 15:30:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2018-10-10 15:30:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-10-10 15:30:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 682 transitions. [2018-10-10 15:30:48,656 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 682 transitions. Word has length 667 [2018-10-10 15:30:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:48,656 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 682 transitions. [2018-10-10 15:30:48,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:30:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 682 transitions. [2018-10-10 15:30:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2018-10-10 15:30:48,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:48,660 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:48,660 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:48,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1340394301, now seen corresponding path program 47 times [2018-10-10 15:30:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15181 backedges. 0 proven. 15181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:30:51,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:30:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:30:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:30:51,666 INFO L87 Difference]: Start difference. First operand 682 states and 682 transitions. Second operand 97 states. [2018-10-10 15:30:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:56,608 INFO L93 Difference]: Finished difference Result 708 states and 708 transitions. [2018-10-10 15:30:56,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 15:30:56,608 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 681 [2018-10-10 15:30:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:56,611 INFO L225 Difference]: With dead ends: 708 [2018-10-10 15:30:56,611 INFO L226 Difference]: Without dead ends: 708 [2018-10-10 15:30:56,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-10 15:30:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-10 15:30:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2018-10-10 15:30:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-10-10 15:30:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 696 transitions. [2018-10-10 15:30:56,617 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 696 transitions. Word has length 681 [2018-10-10 15:30:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:56,618 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 696 transitions. [2018-10-10 15:30:56,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:30:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 696 transitions. [2018-10-10 15:30:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-10 15:30:56,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:56,622 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:56,622 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:56,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1003543766, now seen corresponding path program 48 times [2018-10-10 15:30:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15840 backedges. 0 proven. 15840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:30:59,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:59,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-10 15:30:59,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-10 15:30:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-10 15:30:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:30:59,854 INFO L87 Difference]: Start difference. First operand 696 states and 696 transitions. Second operand 99 states. [2018-10-10 15:31:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:04,976 INFO L93 Difference]: Finished difference Result 722 states and 722 transitions. [2018-10-10 15:31:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-10 15:31:04,977 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 695 [2018-10-10 15:31:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:04,979 INFO L225 Difference]: With dead ends: 722 [2018-10-10 15:31:04,979 INFO L226 Difference]: Without dead ends: 722 [2018-10-10 15:31:04,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-10 15:31:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-10-10 15:31:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 710. [2018-10-10 15:31:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-10 15:31:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 710 transitions. [2018-10-10 15:31:04,986 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 710 transitions. Word has length 695 [2018-10-10 15:31:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:04,986 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 710 transitions. [2018-10-10 15:31:04,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-10 15:31:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 710 transitions. [2018-10-10 15:31:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-10 15:31:04,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:04,990 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:04,990 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:04,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:04,990 INFO L82 PathProgramCache]: Analyzing trace with hash -552447663, now seen corresponding path program 49 times [2018-10-10 15:31:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 0 proven. 16513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:08,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:08,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-10 15:31:08,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-10 15:31:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-10 15:31:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 15:31:08,348 INFO L87 Difference]: Start difference. First operand 710 states and 710 transitions. Second operand 101 states. [2018-10-10 15:31:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:13,636 INFO L93 Difference]: Finished difference Result 736 states and 736 transitions. [2018-10-10 15:31:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 15:31:13,636 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 709 [2018-10-10 15:31:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:13,639 INFO L225 Difference]: With dead ends: 736 [2018-10-10 15:31:13,639 INFO L226 Difference]: Without dead ends: 736 [2018-10-10 15:31:13,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 15:31:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-10 15:31:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 724. [2018-10-10 15:31:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-10 15:31:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 724 transitions. [2018-10-10 15:31:13,648 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 724 transitions. Word has length 709 [2018-10-10 15:31:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:13,649 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 724 transitions. [2018-10-10 15:31:13,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-10 15:31:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 724 transitions. [2018-10-10 15:31:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-10-10 15:31:13,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:13,654 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:13,654 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:13,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash -835047624, now seen corresponding path program 50 times [2018-10-10 15:31:13,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17200 backedges. 0 proven. 17200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:16,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:16,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-10 15:31:16,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-10 15:31:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-10 15:31:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:31:16,931 INFO L87 Difference]: Start difference. First operand 724 states and 724 transitions. Second operand 103 states. [2018-10-10 15:31:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:22,274 INFO L93 Difference]: Finished difference Result 750 states and 750 transitions. [2018-10-10 15:31:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-10 15:31:22,275 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 723 [2018-10-10 15:31:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:22,280 INFO L225 Difference]: With dead ends: 750 [2018-10-10 15:31:22,280 INFO L226 Difference]: Without dead ends: 750 [2018-10-10 15:31:22,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 15:31:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-10 15:31:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 738. [2018-10-10 15:31:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-10-10 15:31:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 738 transitions. [2018-10-10 15:31:22,288 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 738 transitions. Word has length 723 [2018-10-10 15:31:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:22,288 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 738 transitions. [2018-10-10 15:31:22,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-10 15:31:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 738 transitions. [2018-10-10 15:31:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2018-10-10 15:31:22,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:22,293 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:22,293 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:22,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash 752364767, now seen corresponding path program 51 times [2018-10-10 15:31:22,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17901 backedges. 0 proven. 17901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-10 15:31:25,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-10 15:31:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-10 15:31:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 15:31:25,776 INFO L87 Difference]: Start difference. First operand 738 states and 738 transitions. Second operand 105 states. [2018-10-10 15:31:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:31,408 INFO L93 Difference]: Finished difference Result 764 states and 764 transitions. [2018-10-10 15:31:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-10 15:31:31,409 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 737 [2018-10-10 15:31:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:31,413 INFO L225 Difference]: With dead ends: 764 [2018-10-10 15:31:31,414 INFO L226 Difference]: Without dead ends: 764 [2018-10-10 15:31:31,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-10 15:31:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-10 15:31:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 752. [2018-10-10 15:31:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-10 15:31:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 752 transitions. [2018-10-10 15:31:31,422 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 752 transitions. Word has length 737 [2018-10-10 15:31:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:31,423 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 752 transitions. [2018-10-10 15:31:31,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-10 15:31:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 752 transitions. [2018-10-10 15:31:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-10-10 15:31:31,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:31,427 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:31,427 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:31,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1428571578, now seen corresponding path program 52 times [2018-10-10 15:31:31,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18616 backedges. 0 proven. 18616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:35,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-10 15:31:35,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-10 15:31:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-10 15:31:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:31:35,252 INFO L87 Difference]: Start difference. First operand 752 states and 752 transitions. Second operand 107 states. [2018-10-10 15:31:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:41,352 INFO L93 Difference]: Finished difference Result 778 states and 778 transitions. [2018-10-10 15:31:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-10 15:31:41,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 751 [2018-10-10 15:31:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:41,355 INFO L225 Difference]: With dead ends: 778 [2018-10-10 15:31:41,356 INFO L226 Difference]: Without dead ends: 778 [2018-10-10 15:31:41,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 15:31:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-10-10 15:31:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 766. [2018-10-10 15:31:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-10-10 15:31:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 766 transitions. [2018-10-10 15:31:41,363 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 766 transitions. Word has length 751 [2018-10-10 15:31:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:41,364 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 766 transitions. [2018-10-10 15:31:41,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-10 15:31:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 766 transitions. [2018-10-10 15:31:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2018-10-10 15:31:41,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:41,368 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:41,368 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:41,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 333989741, now seen corresponding path program 53 times [2018-10-10 15:31:41,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19345 backedges. 0 proven. 19345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:45,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-10 15:31:45,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-10 15:31:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-10 15:31:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-10 15:31:45,381 INFO L87 Difference]: Start difference. First operand 766 states and 766 transitions. Second operand 109 states. [2018-10-10 15:31:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:51,421 INFO L93 Difference]: Finished difference Result 792 states and 792 transitions. [2018-10-10 15:31:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-10 15:31:51,422 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 765 [2018-10-10 15:31:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:51,424 INFO L225 Difference]: With dead ends: 792 [2018-10-10 15:31:51,424 INFO L226 Difference]: Without dead ends: 792 [2018-10-10 15:31:51,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 15:31:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-10-10 15:31:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 780. [2018-10-10 15:31:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-10 15:31:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 780 transitions. [2018-10-10 15:31:51,432 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 780 transitions. Word has length 765 [2018-10-10 15:31:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:51,433 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 780 transitions. [2018-10-10 15:31:51,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-10 15:31:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 780 transitions. [2018-10-10 15:31:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-10-10 15:31:51,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:51,438 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:51,438 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:51,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:51,438 INFO L82 PathProgramCache]: Analyzing trace with hash 375997524, now seen corresponding path program 54 times [2018-10-10 15:31:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20088 backedges. 0 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:31:55,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-10 15:31:55,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-10 15:31:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-10 15:31:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:31:55,476 INFO L87 Difference]: Start difference. First operand 780 states and 780 transitions. Second operand 111 states. [2018-10-10 15:32:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:01,838 INFO L93 Difference]: Finished difference Result 806 states and 806 transitions. [2018-10-10 15:32:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 15:32:01,839 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 779 [2018-10-10 15:32:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:01,841 INFO L225 Difference]: With dead ends: 806 [2018-10-10 15:32:01,841 INFO L226 Difference]: Without dead ends: 806 [2018-10-10 15:32:01,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-10 15:32:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-10 15:32:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 794. [2018-10-10 15:32:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-10-10 15:32:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 794 transitions. [2018-10-10 15:32:01,847 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 794 transitions. Word has length 779 [2018-10-10 15:32:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:01,848 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 794 transitions. [2018-10-10 15:32:01,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-10 15:32:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 794 transitions. [2018-10-10 15:32:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-10-10 15:32:01,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:01,852 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:01,852 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:01,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash -897703685, now seen corresponding path program 55 times [2018-10-10 15:32:01,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20845 backedges. 0 proven. 20845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:05,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:05,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-10 15:32:05,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-10 15:32:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-10 15:32:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 15:32:05,931 INFO L87 Difference]: Start difference. First operand 794 states and 794 transitions. Second operand 113 states. [2018-10-10 15:32:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:12,735 INFO L93 Difference]: Finished difference Result 820 states and 820 transitions. [2018-10-10 15:32:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-10 15:32:12,735 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 793 [2018-10-10 15:32:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:12,738 INFO L225 Difference]: With dead ends: 820 [2018-10-10 15:32:12,738 INFO L226 Difference]: Without dead ends: 820 [2018-10-10 15:32:12,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-10 15:32:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-10-10 15:32:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 808. [2018-10-10 15:32:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-10 15:32:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 808 transitions. [2018-10-10 15:32:12,747 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 808 transitions. Word has length 793 [2018-10-10 15:32:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:12,747 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 808 transitions. [2018-10-10 15:32:12,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-10 15:32:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 808 transitions. [2018-10-10 15:32:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-10-10 15:32:12,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:12,752 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:12,752 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:12,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -117158558, now seen corresponding path program 56 times [2018-10-10 15:32:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21616 backedges. 0 proven. 21616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:17,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:17,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-10 15:32:17,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-10 15:32:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-10 15:32:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:32:17,049 INFO L87 Difference]: Start difference. First operand 808 states and 808 transitions. Second operand 115 states. [2018-10-10 15:32:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:23,734 INFO L93 Difference]: Finished difference Result 834 states and 834 transitions. [2018-10-10 15:32:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-10 15:32:23,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 807 [2018-10-10 15:32:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:23,738 INFO L225 Difference]: With dead ends: 834 [2018-10-10 15:32:23,738 INFO L226 Difference]: Without dead ends: 834 [2018-10-10 15:32:23,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-10 15:32:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-10-10 15:32:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 822. [2018-10-10 15:32:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-10-10 15:32:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 822 transitions. [2018-10-10 15:32:23,745 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 822 transitions. Word has length 807 [2018-10-10 15:32:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:23,745 INFO L481 AbstractCegarLoop]: Abstraction has 822 states and 822 transitions. [2018-10-10 15:32:23,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-10 15:32:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 822 transitions. [2018-10-10 15:32:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2018-10-10 15:32:23,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:23,750 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:23,750 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:23,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:23,751 INFO L82 PathProgramCache]: Analyzing trace with hash 580204937, now seen corresponding path program 57 times [2018-10-10 15:32:23,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22401 backedges. 0 proven. 22401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:28,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-10 15:32:28,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-10 15:32:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-10 15:32:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 15:32:28,270 INFO L87 Difference]: Start difference. First operand 822 states and 822 transitions. Second operand 117 states. [2018-10-10 15:32:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:35,594 INFO L93 Difference]: Finished difference Result 848 states and 848 transitions. [2018-10-10 15:32:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-10 15:32:35,594 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 821 [2018-10-10 15:32:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:35,598 INFO L225 Difference]: With dead ends: 848 [2018-10-10 15:32:35,598 INFO L226 Difference]: Without dead ends: 848 [2018-10-10 15:32:35,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-10 15:32:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-10 15:32:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 836. [2018-10-10 15:32:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-10-10 15:32:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 836 transitions. [2018-10-10 15:32:35,605 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 836 transitions. Word has length 821 [2018-10-10 15:32:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:35,605 INFO L481 AbstractCegarLoop]: Abstraction has 836 states and 836 transitions. [2018-10-10 15:32:35,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-10 15:32:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 836 transitions. [2018-10-10 15:32:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-10-10 15:32:35,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:35,610 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:35,610 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:35,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1183208816, now seen corresponding path program 58 times [2018-10-10 15:32:35,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23200 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-10 15:32:40,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-10 15:32:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-10 15:32:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 15:32:40,191 INFO L87 Difference]: Start difference. First operand 836 states and 836 transitions. Second operand 119 states. [2018-10-10 15:32:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:47,318 INFO L93 Difference]: Finished difference Result 862 states and 862 transitions. [2018-10-10 15:32:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 15:32:47,318 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 835 [2018-10-10 15:32:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:47,321 INFO L225 Difference]: With dead ends: 862 [2018-10-10 15:32:47,321 INFO L226 Difference]: Without dead ends: 862 [2018-10-10 15:32:47,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-10 15:32:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-10-10 15:32:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 850. [2018-10-10 15:32:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-10-10 15:32:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 850 transitions. [2018-10-10 15:32:47,328 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 850 transitions. Word has length 835 [2018-10-10 15:32:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:47,329 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 850 transitions. [2018-10-10 15:32:47,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-10 15:32:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 850 transitions. [2018-10-10 15:32:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2018-10-10 15:32:47,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:47,334 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:47,334 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:47,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1776881943, now seen corresponding path program 59 times [2018-10-10 15:32:47,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24013 backedges. 0 proven. 24013 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:52,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:52,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-10 15:32:52,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-10 15:32:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-10 15:32:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-10 15:32:52,035 INFO L87 Difference]: Start difference. First operand 850 states and 850 transitions. Second operand 121 states. [2018-10-10 15:32:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:59,585 INFO L93 Difference]: Finished difference Result 876 states and 876 transitions. [2018-10-10 15:32:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-10 15:32:59,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 849 [2018-10-10 15:32:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:59,588 INFO L225 Difference]: With dead ends: 876 [2018-10-10 15:32:59,588 INFO L226 Difference]: Without dead ends: 876 [2018-10-10 15:32:59,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-10 15:32:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-10-10 15:32:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 864. [2018-10-10 15:32:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-10-10 15:32:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 864 transitions. [2018-10-10 15:32:59,596 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 864 transitions. Word has length 849 [2018-10-10 15:32:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:59,597 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 864 transitions. [2018-10-10 15:32:59,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-10 15:32:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 864 transitions. [2018-10-10 15:32:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2018-10-10 15:32:59,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:59,602 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:59,602 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:59,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -561324930, now seen corresponding path program 60 times [2018-10-10 15:32:59,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24840 backedges. 0 proven. 24840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:33:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:04,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-10 15:33:04,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-10 15:33:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-10 15:33:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 15:33:04,228 INFO L87 Difference]: Start difference. First operand 864 states and 864 transitions. Second operand 123 states. [2018-10-10 15:33:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:12,007 INFO L93 Difference]: Finished difference Result 890 states and 890 transitions. [2018-10-10 15:33:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-10 15:33:12,007 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 863 [2018-10-10 15:33:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:12,012 INFO L225 Difference]: With dead ends: 890 [2018-10-10 15:33:12,012 INFO L226 Difference]: Without dead ends: 890 [2018-10-10 15:33:12,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-10 15:33:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-10-10 15:33:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 878. [2018-10-10 15:33:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-10-10 15:33:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 878 transitions. [2018-10-10 15:33:12,019 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 878 transitions. Word has length 863 [2018-10-10 15:33:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:12,020 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 878 transitions. [2018-10-10 15:33:12,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-10 15:33:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 878 transitions. [2018-10-10 15:33:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-10-10 15:33:12,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:12,025 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:12,025 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:12,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1240803237, now seen corresponding path program 61 times [2018-10-10 15:33:12,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 25681 backedges. 0 proven. 25681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:33:16,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:16,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-10 15:33:16,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-10 15:33:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-10 15:33:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-10 15:33:16,892 INFO L87 Difference]: Start difference. First operand 878 states and 878 transitions. Second operand 125 states. [2018-10-10 15:33:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:24,822 INFO L93 Difference]: Finished difference Result 904 states and 904 transitions. [2018-10-10 15:33:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-10 15:33:24,823 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 877 [2018-10-10 15:33:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:24,826 INFO L225 Difference]: With dead ends: 904 [2018-10-10 15:33:24,826 INFO L226 Difference]: Without dead ends: 904 [2018-10-10 15:33:24,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-10 15:33:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-10-10 15:33:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 892. [2018-10-10 15:33:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-10-10 15:33:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 892 transitions. [2018-10-10 15:33:24,835 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 892 transitions. Word has length 877 [2018-10-10 15:33:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:24,835 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 892 transitions. [2018-10-10 15:33:24,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-10 15:33:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 892 transitions. [2018-10-10 15:33:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-10-10 15:33:24,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:24,841 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:24,841 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:24,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1819107980, now seen corresponding path program 62 times [2018-10-10 15:33:24,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26536 backedges. 0 proven. 26536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:33:29,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:29,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-10 15:33:29,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-10 15:33:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-10 15:33:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:33:29,970 INFO L87 Difference]: Start difference. First operand 892 states and 892 transitions. Second operand 127 states. [2018-10-10 15:33:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:38,566 INFO L93 Difference]: Finished difference Result 918 states and 918 transitions. [2018-10-10 15:33:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-10 15:33:38,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 891 [2018-10-10 15:33:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:38,570 INFO L225 Difference]: With dead ends: 918 [2018-10-10 15:33:38,570 INFO L226 Difference]: Without dead ends: 918 [2018-10-10 15:33:38,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-10 15:33:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-10-10 15:33:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 906. [2018-10-10 15:33:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-10-10 15:33:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 906 transitions. [2018-10-10 15:33:38,580 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 906 transitions. Word has length 891 [2018-10-10 15:33:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:38,581 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 906 transitions. [2018-10-10 15:33:38,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-10 15:33:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 906 transitions. [2018-10-10 15:33:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2018-10-10 15:33:38,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:38,588 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:38,588 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1477116621, now seen corresponding path program 63 times [2018-10-10 15:33:38,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27405 backedges. 0 proven. 27405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:33:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-10 15:33:43,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-10 15:33:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-10 15:33:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 15:33:43,930 INFO L87 Difference]: Start difference. First operand 906 states and 906 transitions. Second operand 129 states. [2018-10-10 15:33:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:52,632 INFO L93 Difference]: Finished difference Result 932 states and 932 transitions. [2018-10-10 15:33:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-10 15:33:52,633 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 905 [2018-10-10 15:33:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:52,638 INFO L225 Difference]: With dead ends: 932 [2018-10-10 15:33:52,638 INFO L226 Difference]: Without dead ends: 932 [2018-10-10 15:33:52,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-10 15:33:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-10-10 15:33:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2018-10-10 15:33:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-10-10 15:33:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 920 transitions. [2018-10-10 15:33:52,648 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 920 transitions. Word has length 905 [2018-10-10 15:33:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:52,649 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 920 transitions. [2018-10-10 15:33:52,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-10 15:33:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 920 transitions. [2018-10-10 15:33:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-10-10 15:33:52,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:52,655 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:52,655 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1195992986, now seen corresponding path program 64 times [2018-10-10 15:33:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28288 backedges. 0 proven. 28288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:33:58,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:58,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-10 15:33:58,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-10 15:33:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-10 15:33:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 15:33:58,098 INFO L87 Difference]: Start difference. First operand 920 states and 920 transitions. Second operand 131 states. [2018-10-10 15:34:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:34:06,825 INFO L93 Difference]: Finished difference Result 946 states and 946 transitions. [2018-10-10 15:34:06,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-10 15:34:06,825 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 919 [2018-10-10 15:34:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:34:06,828 INFO L225 Difference]: With dead ends: 946 [2018-10-10 15:34:06,828 INFO L226 Difference]: Without dead ends: 946 [2018-10-10 15:34:06,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-10 15:34:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-10-10 15:34:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 934. [2018-10-10 15:34:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-10-10 15:34:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 934 transitions. [2018-10-10 15:34:06,838 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 934 transitions. Word has length 919 [2018-10-10 15:34:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:34:06,838 INFO L481 AbstractCegarLoop]: Abstraction has 934 states and 934 transitions. [2018-10-10 15:34:06,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-10 15:34:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 934 transitions. [2018-10-10 15:34:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2018-10-10 15:34:06,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:34:06,846 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:34:06,846 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:34:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:34:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2065428031, now seen corresponding path program 65 times [2018-10-10 15:34:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:34:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:34:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29185 backedges. 0 proven. 29185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:34:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:34:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-10 15:34:12,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-10 15:34:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-10 15:34:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 15:34:12,312 INFO L87 Difference]: Start difference. First operand 934 states and 934 transitions. Second operand 133 states. [2018-10-10 15:34:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:34:21,064 INFO L93 Difference]: Finished difference Result 960 states and 960 transitions. [2018-10-10 15:34:21,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 15:34:21,064 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 933 [2018-10-10 15:34:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:34:21,066 INFO L225 Difference]: With dead ends: 960 [2018-10-10 15:34:21,066 INFO L226 Difference]: Without dead ends: 960 [2018-10-10 15:34:21,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-10 15:34:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-10-10 15:34:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 948. [2018-10-10 15:34:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-10 15:34:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 948 transitions. [2018-10-10 15:34:21,078 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 948 transitions. Word has length 933 [2018-10-10 15:34:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:34:21,079 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 948 transitions. [2018-10-10 15:34:21,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-10 15:34:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 948 transitions. [2018-10-10 15:34:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2018-10-10 15:34:21,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:34:21,085 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:34:21,085 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:34:21,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:34:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1375366056, now seen corresponding path program 66 times [2018-10-10 15:34:21,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:34:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:34:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30096 backedges. 0 proven. 30096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:34:26,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:34:26,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-10 15:34:26,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-10 15:34:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-10 15:34:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 15:34:26,761 INFO L87 Difference]: Start difference. First operand 948 states and 948 transitions. Second operand 135 states. [2018-10-10 15:34:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:34:35,803 INFO L93 Difference]: Finished difference Result 974 states and 974 transitions. [2018-10-10 15:34:35,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-10 15:34:35,803 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 947 [2018-10-10 15:34:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:34:35,805 INFO L225 Difference]: With dead ends: 974 [2018-10-10 15:34:35,805 INFO L226 Difference]: Without dead ends: 974 [2018-10-10 15:34:35,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 15:34:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-10-10 15:34:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 962. [2018-10-10 15:34:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-10-10 15:34:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 962 transitions. [2018-10-10 15:34:35,817 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 962 transitions. Word has length 947 [2018-10-10 15:34:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:34:35,817 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 962 transitions. [2018-10-10 15:34:35,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-10 15:34:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 962 transitions. [2018-10-10 15:34:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-10-10 15:34:35,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:34:35,823 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:34:35,823 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:34:35,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:34:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash -578951857, now seen corresponding path program 67 times [2018-10-10 15:34:35,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:34:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:34:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 31021 backedges. 0 proven. 31021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:34:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:34:41,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-10 15:34:41,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-10 15:34:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-10 15:34:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 15:34:41,768 INFO L87 Difference]: Start difference. First operand 962 states and 962 transitions. Second operand 137 states. [2018-10-10 15:34:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:34:51,106 INFO L93 Difference]: Finished difference Result 988 states and 988 transitions. [2018-10-10 15:34:51,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-10 15:34:51,107 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 961 [2018-10-10 15:34:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:34:51,108 INFO L225 Difference]: With dead ends: 988 [2018-10-10 15:34:51,108 INFO L226 Difference]: Without dead ends: 988 [2018-10-10 15:34:51,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-10 15:34:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-10 15:34:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 976. [2018-10-10 15:34:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-10-10 15:34:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 976 transitions. [2018-10-10 15:34:51,117 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 976 transitions. Word has length 961 [2018-10-10 15:34:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:34:51,117 INFO L481 AbstractCegarLoop]: Abstraction has 976 states and 976 transitions. [2018-10-10 15:34:51,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-10 15:34:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 976 transitions. [2018-10-10 15:34:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-10-10 15:34:51,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:34:51,123 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:34:51,124 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:34:51,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:34:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash -618926410, now seen corresponding path program 68 times [2018-10-10 15:34:51,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:34:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:34:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 31960 backedges. 0 proven. 31960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:34:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:34:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-10 15:34:57,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-10 15:34:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-10 15:34:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:34:57,309 INFO L87 Difference]: Start difference. First operand 976 states and 976 transitions. Second operand 139 states. [2018-10-10 15:35:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:35:07,172 INFO L93 Difference]: Finished difference Result 1002 states and 1002 transitions. [2018-10-10 15:35:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-10 15:35:07,172 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 975 [2018-10-10 15:35:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:35:07,174 INFO L225 Difference]: With dead ends: 1002 [2018-10-10 15:35:07,174 INFO L226 Difference]: Without dead ends: 1002 [2018-10-10 15:35:07,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-10 15:35:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-10-10 15:35:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 990. [2018-10-10 15:35:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2018-10-10 15:35:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 990 transitions. [2018-10-10 15:35:07,182 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 990 transitions. Word has length 975 [2018-10-10 15:35:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:35:07,182 INFO L481 AbstractCegarLoop]: Abstraction has 990 states and 990 transitions. [2018-10-10 15:35:07,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-10 15:35:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 990 transitions. [2018-10-10 15:35:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-10-10 15:35:07,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:35:07,189 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:35:07,189 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:35:07,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:35:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1975650339, now seen corresponding path program 69 times [2018-10-10 15:35:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:35:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:35:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32913 backedges. 0 proven. 32913 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:35:13,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:35:13,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-10 15:35:13,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-10 15:35:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-10 15:35:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-10 15:35:13,318 INFO L87 Difference]: Start difference. First operand 990 states and 990 transitions. Second operand 141 states. [2018-10-10 15:35:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:35:23,367 INFO L93 Difference]: Finished difference Result 1016 states and 1016 transitions. [2018-10-10 15:35:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-10 15:35:23,367 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 989 [2018-10-10 15:35:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:35:23,369 INFO L225 Difference]: With dead ends: 1016 [2018-10-10 15:35:23,369 INFO L226 Difference]: Without dead ends: 1016 [2018-10-10 15:35:23,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-10 15:35:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-10-10 15:35:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1004. [2018-10-10 15:35:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-10-10 15:35:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1004 transitions. [2018-10-10 15:35:23,376 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1004 transitions. Word has length 989 [2018-10-10 15:35:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:35:23,377 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1004 transitions. [2018-10-10 15:35:23,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-10 15:35:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1004 transitions. [2018-10-10 15:35:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2018-10-10 15:35:23,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:35:23,383 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:35:23,384 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:35:23,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:35:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2097770692, now seen corresponding path program 70 times [2018-10-10 15:35:23,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:35:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:35:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33880 backedges. 0 proven. 33880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:35:29,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:35:29,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-10 15:35:29,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-10 15:35:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-10 15:35:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 15:35:29,603 INFO L87 Difference]: Start difference. First operand 1004 states and 1004 transitions. Second operand 143 states. [2018-10-10 15:35:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:35:39,908 INFO L93 Difference]: Finished difference Result 1030 states and 1030 transitions. [2018-10-10 15:35:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-10 15:35:39,908 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 1003 [2018-10-10 15:35:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:35:39,909 INFO L225 Difference]: With dead ends: 1030 [2018-10-10 15:35:39,910 INFO L226 Difference]: Without dead ends: 1030 [2018-10-10 15:35:39,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-10 15:35:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-10-10 15:35:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1018. [2018-10-10 15:35:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-10-10 15:35:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1018 transitions. [2018-10-10 15:35:39,917 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1018 transitions. Word has length 1003 [2018-10-10 15:35:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:35:39,918 INFO L481 AbstractCegarLoop]: Abstraction has 1018 states and 1018 transitions. [2018-10-10 15:35:39,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-10 15:35:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1018 transitions. [2018-10-10 15:35:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2018-10-10 15:35:39,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:35:39,924 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:35:39,925 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:35:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:35:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash 526371179, now seen corresponding path program 71 times [2018-10-10 15:35:39,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:35:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:35:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 34861 backedges. 0 proven. 34861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:35:46,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:35:46,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-10 15:35:46,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-10 15:35:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-10 15:35:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-10 15:35:46,405 INFO L87 Difference]: Start difference. First operand 1018 states and 1018 transitions. Second operand 145 states. [2018-10-10 15:35:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:35:57,059 INFO L93 Difference]: Finished difference Result 1044 states and 1044 transitions. [2018-10-10 15:35:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-10 15:35:57,060 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 1017 [2018-10-10 15:35:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:35:57,061 INFO L225 Difference]: With dead ends: 1044 [2018-10-10 15:35:57,061 INFO L226 Difference]: Without dead ends: 1044 [2018-10-10 15:35:57,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-10 15:35:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-10-10 15:35:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1032. [2018-10-10 15:35:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-10-10 15:35:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1032 transitions. [2018-10-10 15:35:57,071 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1032 transitions. Word has length 1017 [2018-10-10 15:35:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:35:57,071 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1032 transitions. [2018-10-10 15:35:57,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-10 15:35:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1032 transitions. [2018-10-10 15:35:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2018-10-10 15:35:57,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:35:57,078 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:35:57,078 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:35:57,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:35:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash -35753518, now seen corresponding path program 72 times [2018-10-10 15:35:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:35:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 35856 backedges. 0 proven. 35856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:03,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:03,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-10 15:36:03,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-10 15:36:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-10 15:36:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:36:03,749 INFO L87 Difference]: Start difference. First operand 1032 states and 1032 transitions. Second operand 147 states. [2018-10-10 15:36:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:14,989 INFO L93 Difference]: Finished difference Result 1058 states and 1058 transitions. [2018-10-10 15:36:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-10 15:36:14,989 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 1031 [2018-10-10 15:36:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:14,991 INFO L225 Difference]: With dead ends: 1058 [2018-10-10 15:36:14,991 INFO L226 Difference]: Without dead ends: 1058 [2018-10-10 15:36:14,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-10 15:36:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-10-10 15:36:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1046. [2018-10-10 15:36:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2018-10-10 15:36:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1046 transitions. [2018-10-10 15:36:15,002 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1046 transitions. Word has length 1031 [2018-10-10 15:36:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:15,003 INFO L481 AbstractCegarLoop]: Abstraction has 1046 states and 1046 transitions. [2018-10-10 15:36:15,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-10 15:36:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1046 transitions. [2018-10-10 15:36:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2018-10-10 15:36:15,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:15,012 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:36:15,012 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:15,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash -857810439, now seen corresponding path program 73 times [2018-10-10 15:36:15,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36865 backedges. 0 proven. 36865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:21,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-10 15:36:21,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-10 15:36:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-10 15:36:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-10 15:36:21,828 INFO L87 Difference]: Start difference. First operand 1046 states and 1046 transitions. Second operand 149 states.