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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset3_true-valid-memsafety_true-termination.c_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:38:34,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:38:34,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:38:34,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:38:34,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:38:34,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:38:34,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:38:34,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:38:34,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:38:34,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:38:34,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:38:34,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:38:34,164 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:38:34,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:38:34,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:38:34,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:38:34,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:38:34,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:38:34,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:38:34,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:38:34,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:38:34,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:38:34,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:38:34,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:38:34,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:38:34,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:38:34,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:38:34,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:38:34,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:38:34,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:38:34,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:38:34,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:38:34,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:38:34,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:38:34,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:38:34,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:38:34,213 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 16:38:34,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:38:34,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:38:34,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:38:34,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:38:34,230 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:38:34,230 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:38:34,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:38:34,231 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:38:34,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:38:34,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:38:34,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:38:34,233 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:38:34,233 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:38:34,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:38:34,234 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:38:34,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:38:34,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:38:34,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:38:34,322 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:38:34,323 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:38:34,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset3_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 16:38:34,324 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset3_true-valid-memsafety_true-termination.c_4.bpl' [2018-10-10 16:38:34,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:38:34,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:38:34,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:38:34,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:38:34,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:38:34,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/1) ... [2018-10-10 16:38:34,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:38:34,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:38:34,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:38:34,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:38:34,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (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 16:38:34,556 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:38:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:38:34,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:38:35,006 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:38:35,006 INFO L202 PluginConnector]: Adding new model memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:35 BoogieIcfgContainer [2018-10-10 16:38:35,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:38:35,007 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:38:35,007 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:38:35,009 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:38:35,012 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:35" (1/1) ... [2018-10-10 16:38:35,021 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:38:35,021 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [] [2018-10-10 16:38:35,054 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:38:35,087 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:38:35,100 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:38:35,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:38:36,135 INFO L315 AbstractInterpreter]: Visited 41 different actions 70 times. Merged at 14 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-10 16:38:36,137 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:38:36,141 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:38:36,143 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:38:36,144 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:38:36,157 INFO L202 PluginConnector]: Adding new model memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:38:36 BasicIcfg [2018-10-10 16:38:36,158 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:38:36,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:38:36,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:38:36,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:38:36,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:34" (1/3) ... [2018-10-10 16:38:36,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b016395 and model type memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:38:36, skipping insertion in model container [2018-10-10 16:38:36,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:35" (2/3) ... [2018-10-10 16:38:36,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b016395 and model type memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:38:36, skipping insertion in model container [2018-10-10 16:38:36,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:38:36" (3/3) ... [2018-10-10 16:38:36,169 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:38:36,180 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:38:36,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:38:36,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:38:36,238 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:38:36,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:38:36,239 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:38:36,239 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:38:36,239 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:38:36,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:38:36,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:38:36,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:38:36,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:38:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-10 16:38:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 16:38:36,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:36,268 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 16:38:36,269 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:36,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 714052947, now seen corresponding path program 1 times [2018-10-10 16:38:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:36,722 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 16:38:36,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:38:36,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 16:38:36,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 16:38:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 16:38:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:38:36,747 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-10-10 16:38:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:36,914 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-10 16:38:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 16:38:36,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-10 16:38:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:36,927 INFO L225 Difference]: With dead ends: 41 [2018-10-10 16:38:36,927 INFO L226 Difference]: Without dead ends: 41 [2018-10-10 16:38:36,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:38:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-10 16:38:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-10 16:38:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 16:38:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 16:38:37,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-10-10 16:38:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:37,050 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 16:38:37,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 16:38:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 16:38:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 16:38:37,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:37,053 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, 1, 1] [2018-10-10 16:38:37,053 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:37,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1703877269, now seen corresponding path program 1 times [2018-10-10 16:38:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:37,240 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 16:38:37,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:37,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:38:37,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:38:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:38:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:38:37,243 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-10 16:38:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:37,432 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-10 16:38:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 16:38:37,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-10 16:38:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:37,434 INFO L225 Difference]: With dead ends: 43 [2018-10-10 16:38:37,434 INFO L226 Difference]: Without dead ends: 43 [2018-10-10 16:38:37,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:38:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-10 16:38:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-10 16:38:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-10 16:38:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-10 16:38:37,440 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-10-10 16:38:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:37,441 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-10 16:38:37,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:38:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-10 16:38:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 16:38:37,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:37,443 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:37,443 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:37,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -557689001, now seen corresponding path program 2 times [2018-10-10 16:38:37,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 16:38:37,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:38:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:38:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:38:37,708 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 6 states. [2018-10-10 16:38:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:37,838 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 16:38:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:38:37,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-10 16:38:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:37,842 INFO L225 Difference]: With dead ends: 45 [2018-10-10 16:38:37,842 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 16:38:37,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:38:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 16:38:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-10 16:38:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-10 16:38:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-10 16:38:37,847 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-10-10 16:38:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:37,848 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-10 16:38:37,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:38:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-10 16:38:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 16:38:37,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:37,849 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:37,850 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:37,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash -669422695, now seen corresponding path program 3 times [2018-10-10 16:38:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:38,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:38,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:38:38,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:38:38,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:38:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:38:38,006 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 7 states. [2018-10-10 16:38:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:38,148 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-10 16:38:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 16:38:38,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-10 16:38:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:38,149 INFO L225 Difference]: With dead ends: 47 [2018-10-10 16:38:38,149 INFO L226 Difference]: Without dead ends: 47 [2018-10-10 16:38:38,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:38:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-10 16:38:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-10 16:38:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 16:38:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 16:38:38,155 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-10-10 16:38:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:38,155 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 16:38:38,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:38:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 16:38:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 16:38:38,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:38,157 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:38,158 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:38,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash -671320229, now seen corresponding path program 4 times [2018-10-10 16:38:38,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:38,326 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 16:38:38,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:38,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:38:38,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:38:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:38:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:38:38,327 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 8 states. [2018-10-10 16:38:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:38,842 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-10 16:38:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:38:38,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-10-10 16:38:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:38,846 INFO L225 Difference]: With dead ends: 49 [2018-10-10 16:38:38,847 INFO L226 Difference]: Without dead ends: 49 [2018-10-10 16:38:38,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:38:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-10 16:38:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-10 16:38:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 16:38:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-10 16:38:38,852 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-10-10 16:38:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:38,852 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-10 16:38:38,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:38:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-10 16:38:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 16:38:38,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:38,854 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:38,854 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:38,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1800116893, now seen corresponding path program 5 times [2018-10-10 16:38:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:39,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:39,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:38:39,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:38:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:38:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:38:39,073 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 9 states. [2018-10-10 16:38:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:39,292 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 16:38:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:38:39,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-10 16:38:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:39,294 INFO L225 Difference]: With dead ends: 51 [2018-10-10 16:38:39,294 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 16:38:39,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:38:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 16:38:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-10 16:38:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-10 16:38:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-10 16:38:39,300 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-10-10 16:38:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:39,300 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-10 16:38:39,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:38:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-10 16:38:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 16:38:39,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:39,301 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:39,302 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:39,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1734276447, now seen corresponding path program 6 times [2018-10-10 16:38:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:39,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:39,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:38:39,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:38:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:38:39,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:38:39,437 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 10 states. [2018-10-10 16:38:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:39,653 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-10 16:38:39,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:38:39,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-10-10 16:38:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:39,656 INFO L225 Difference]: With dead ends: 53 [2018-10-10 16:38:39,656 INFO L226 Difference]: Without dead ends: 53 [2018-10-10 16:38:39,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:38:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-10 16:38:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-10 16:38:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 16:38:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 16:38:39,661 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-10-10 16:38:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:39,661 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 16:38:39,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:38:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 16:38:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 16:38:39,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:39,662 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:39,663 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:39,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1408850015, now seen corresponding path program 7 times [2018-10-10 16:38:39,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:39,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:39,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:38:39,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:38:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:38:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:38:39,920 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 11 states. [2018-10-10 16:38:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:40,229 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 16:38:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:38:40,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-10-10 16:38:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:40,233 INFO L225 Difference]: With dead ends: 55 [2018-10-10 16:38:40,233 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 16:38:40,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:38:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 16:38:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-10 16:38:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-10 16:38:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-10 16:38:40,237 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-10-10 16:38:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:40,238 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-10 16:38:40,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:38:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-10 16:38:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 16:38:40,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:40,239 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:40,239 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:40,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1703596387, now seen corresponding path program 8 times [2018-10-10 16:38:40,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:40,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:40,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:38:40,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:38:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:38:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:38:40,482 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2018-10-10 16:38:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:40,664 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 16:38:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:38:40,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-10-10 16:38:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:40,666 INFO L225 Difference]: With dead ends: 57 [2018-10-10 16:38:40,666 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 16:38:40,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:38:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 16:38:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-10 16:38:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 16:38:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 16:38:40,672 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-10-10 16:38:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:40,673 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 16:38:40,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:38:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 16:38:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 16:38:40,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:40,674 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:40,674 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:40,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash -827616603, now seen corresponding path program 9 times [2018-10-10 16:38:40,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:38:40,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:38:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:38:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:38:40,834 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2018-10-10 16:38:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:41,019 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-10 16:38:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:38:41,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-10-10 16:38:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:41,021 INFO L225 Difference]: With dead ends: 59 [2018-10-10 16:38:41,022 INFO L226 Difference]: Without dead ends: 59 [2018-10-10 16:38:41,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:38:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-10 16:38:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-10 16:38:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 16:38:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 16:38:41,026 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-10-10 16:38:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:41,027 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 16:38:41,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:38:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 16:38:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 16:38:41,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:41,029 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:41,029 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:41,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1923156839, now seen corresponding path program 10 times [2018-10-10 16:38:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:38:41,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:38:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:38:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:38:41,232 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 14 states. [2018-10-10 16:38:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:41,468 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 16:38:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:38:41,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-10-10 16:38:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:41,470 INFO L225 Difference]: With dead ends: 61 [2018-10-10 16:38:41,470 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 16:38:41,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:38:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 16:38:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-10 16:38:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-10 16:38:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-10 16:38:41,476 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-10-10 16:38:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:41,476 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-10 16:38:41,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:38:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-10 16:38:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 16:38:41,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:41,478 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:41,478 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:41,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:41,478 INFO L82 PathProgramCache]: Analyzing trace with hash -283419735, now seen corresponding path program 11 times [2018-10-10 16:38:41,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:38:42,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:38:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:38:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:38:42,275 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 15 states. [2018-10-10 16:38:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:42,656 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 16:38:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:38:42,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-10-10 16:38:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:42,658 INFO L225 Difference]: With dead ends: 63 [2018-10-10 16:38:42,658 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 16:38:42,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:38:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 16:38:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-10 16:38:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 16:38:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 16:38:42,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-10-10 16:38:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:42,664 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 16:38:42,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:38:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 16:38:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 16:38:42,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:42,665 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:42,666 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 910336875, now seen corresponding path program 12 times [2018-10-10 16:38:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:42,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:42,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:38:42,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:38:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:38:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:38:42,968 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 16 states. [2018-10-10 16:38:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:43,463 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 16:38:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:38:43,464 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-10-10 16:38:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:43,465 INFO L225 Difference]: With dead ends: 65 [2018-10-10 16:38:43,465 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 16:38:43,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:38:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 16:38:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-10 16:38:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 16:38:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 16:38:43,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-10-10 16:38:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:43,475 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 16:38:43,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:38:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 16:38:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 16:38:43,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:43,483 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:43,483 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:43,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1354171053, now seen corresponding path program 13 times [2018-10-10 16:38:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:43,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:43,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:38:43,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:38:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:38:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:38:43,865 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 17 states. [2018-10-10 16:38:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:44,203 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 16:38:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:38:44,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-10-10 16:38:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:44,204 INFO L225 Difference]: With dead ends: 67 [2018-10-10 16:38:44,205 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 16:38:44,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:38:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 16:38:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-10 16:38:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 16:38:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 16:38:44,208 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-10-10 16:38:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:44,209 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 16:38:44,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:38:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 16:38:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 16:38:44,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:44,210 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:44,210 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:44,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1617913489, now seen corresponding path program 14 times [2018-10-10 16:38:44,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:44,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:44,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:38:44,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:38:44,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:38:44,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:38:44,523 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 18 states. [2018-10-10 16:38:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:44,849 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-10 16:38:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:38:44,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-10-10 16:38:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:44,850 INFO L225 Difference]: With dead ends: 69 [2018-10-10 16:38:44,851 INFO L226 Difference]: Without dead ends: 69 [2018-10-10 16:38:44,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:38:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-10 16:38:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-10 16:38:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 16:38:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 16:38:44,854 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-10-10 16:38:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:44,855 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 16:38:44,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:38:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 16:38:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 16:38:44,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:44,856 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:44,856 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:44,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1637906511, now seen corresponding path program 15 times [2018-10-10 16:38:44,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:45,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:38:45,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:38:45,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:38:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:38:45,123 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 19 states. [2018-10-10 16:38:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:45,564 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 16:38:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:38:45,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-10-10 16:38:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:45,565 INFO L225 Difference]: With dead ends: 71 [2018-10-10 16:38:45,566 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 16:38:45,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:38:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 16:38:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-10 16:38:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-10 16:38:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-10 16:38:45,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-10-10 16:38:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:45,569 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-10 16:38:45,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:38:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-10 16:38:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 16:38:45,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:45,571 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:45,571 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:45,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash 623635827, now seen corresponding path program 16 times [2018-10-10 16:38:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:45,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:45,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:38:45,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:38:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:38:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:38:45,945 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 20 states. [2018-10-10 16:38:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:46,322 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 16:38:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 16:38:46,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2018-10-10 16:38:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:46,331 INFO L225 Difference]: With dead ends: 73 [2018-10-10 16:38:46,331 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 16:38:46,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:38:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 16:38:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-10 16:38:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 16:38:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 16:38:46,334 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-10-10 16:38:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:46,334 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 16:38:46,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:38:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 16:38:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 16:38:46,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:46,336 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:46,336 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:46,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash 712370869, now seen corresponding path program 17 times [2018-10-10 16:38:46,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:46,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:46,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:38:46,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:38:46,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:38:46,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:38:46,715 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 21 states. [2018-10-10 16:38:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:47,258 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-10 16:38:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:38:47,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-10-10 16:38:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:47,259 INFO L225 Difference]: With dead ends: 75 [2018-10-10 16:38:47,259 INFO L226 Difference]: Without dead ends: 75 [2018-10-10 16:38:47,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:38:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-10 16:38:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-10 16:38:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 16:38:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 16:38:47,262 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-10-10 16:38:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:47,263 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 16:38:47,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:38:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 16:38:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 16:38:47,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:47,264 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:47,264 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:47,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 87400311, now seen corresponding path program 18 times [2018-10-10 16:38:47,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:38:47,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:38:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:38:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:38:47,811 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 22 states. [2018-10-10 16:38:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:48,234 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 16:38:48,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:38:48,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-10-10 16:38:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:48,236 INFO L225 Difference]: With dead ends: 77 [2018-10-10 16:38:48,236 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 16:38:48,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:38:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 16:38:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-10 16:38:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-10 16:38:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-10 16:38:48,241 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-10-10 16:38:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:48,241 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-10 16:38:48,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:38:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-10 16:38:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 16:38:48,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:48,242 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:48,242 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:48,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 786115513, now seen corresponding path program 19 times [2018-10-10 16:38:48,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:49,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:49,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:38:49,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:38:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:38:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:38:49,011 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 23 states. [2018-10-10 16:38:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:49,461 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 16:38:49,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:38:49,461 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2018-10-10 16:38:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:49,462 INFO L225 Difference]: With dead ends: 79 [2018-10-10 16:38:49,463 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 16:38:49,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:38:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 16:38:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-10 16:38:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 16:38:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 16:38:49,467 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-10-10 16:38:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:49,467 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 16:38:49,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:38:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 16:38:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 16:38:49,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:49,468 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:49,468 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:49,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2058440837, now seen corresponding path program 20 times [2018-10-10 16:38:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:50,636 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 16:38:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:38:50,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:38:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:38:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:38:50,638 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 24 states. [2018-10-10 16:38:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:51,181 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-10 16:38:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:38:51,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-10-10 16:38:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:51,183 INFO L225 Difference]: With dead ends: 81 [2018-10-10 16:38:51,183 INFO L226 Difference]: Without dead ends: 81 [2018-10-10 16:38:51,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:38:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-10 16:38:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-10 16:38:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 16:38:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 16:38:51,188 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-10-10 16:38:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:51,188 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 16:38:51,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:38:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 16:38:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 16:38:51,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:51,189 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:51,189 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:51,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 217074365, now seen corresponding path program 21 times [2018-10-10 16:38:51,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:51,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:51,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:38:51,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:38:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:38:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:38:51,785 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 25 states. [2018-10-10 16:38:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:52,571 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 16:38:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:38:52,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-10-10 16:38:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:52,574 INFO L225 Difference]: With dead ends: 83 [2018-10-10 16:38:52,574 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 16:38:52,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:38:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 16:38:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-10 16:38:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-10 16:38:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-10 16:38:52,578 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-10-10 16:38:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:52,578 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-10 16:38:52,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:38:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-10 16:38:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 16:38:52,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:52,579 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:52,580 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:52,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash 848829823, now seen corresponding path program 22 times [2018-10-10 16:38:52,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:52,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:52,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:38:52,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:38:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:38:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:38:52,960 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 26 states. [2018-10-10 16:38:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:53,502 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 16:38:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 16:38:53,502 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-10-10 16:38:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:53,503 INFO L225 Difference]: With dead ends: 85 [2018-10-10 16:38:53,504 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 16:38:53,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:38:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 16:38:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-10 16:38:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 16:38:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 16:38:53,508 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-10-10 16:38:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:53,508 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 16:38:53,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:38:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 16:38:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 16:38:53,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:53,509 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:53,509 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:53,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1919531071, now seen corresponding path program 23 times [2018-10-10 16:38:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:38:53,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:38:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:38:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:38:53,875 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-10-10 16:38:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:54,440 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-10 16:38:54,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:38:54,440 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-10-10 16:38:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:54,441 INFO L225 Difference]: With dead ends: 87 [2018-10-10 16:38:54,441 INFO L226 Difference]: Without dead ends: 87 [2018-10-10 16:38:54,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:38:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-10 16:38:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-10 16:38:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 16:38:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 16:38:54,445 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-10-10 16:38:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:54,445 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 16:38:54,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:38:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 16:38:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 16:38:54,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:54,446 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:54,446 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:54,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 565373315, now seen corresponding path program 24 times [2018-10-10 16:38:54,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:54,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:38:54,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:38:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:38:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:38:54,859 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 28 states. [2018-10-10 16:38:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:55,444 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 16:38:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:38:55,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-10-10 16:38:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:55,448 INFO L225 Difference]: With dead ends: 89 [2018-10-10 16:38:55,448 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 16:38:55,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:38:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 16:38:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-10 16:38:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 16:38:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-10 16:38:55,452 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-10-10 16:38:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:55,452 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-10 16:38:55,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:38:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-10 16:38:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 16:38:55,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:55,453 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:55,453 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:55,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash 556671685, now seen corresponding path program 25 times [2018-10-10 16:38:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:55,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:55,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:38:55,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:38:55,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:38:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:38:55,859 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 29 states. [2018-10-10 16:38:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:56,471 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 16:38:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:38:56,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-10-10 16:38:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:56,473 INFO L225 Difference]: With dead ends: 91 [2018-10-10 16:38:56,473 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 16:38:56,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:38:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 16:38:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-10 16:38:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 16:38:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 16:38:56,478 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-10-10 16:38:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:56,479 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 16:38:56,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:38:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 16:38:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 16:38:56,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:56,480 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:56,480 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:56,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash 784339847, now seen corresponding path program 26 times [2018-10-10 16:38:56,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:57,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:57,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:38:57,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:38:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:38:57,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:38:57,091 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 30 states. [2018-10-10 16:38:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:58,016 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 16:38:58,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:38:58,017 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-10-10 16:38:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:58,017 INFO L225 Difference]: With dead ends: 93 [2018-10-10 16:38:58,017 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 16:38:58,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:38:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 16:38:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-10-10 16:38:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 16:38:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 16:38:58,021 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-10-10 16:38:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:58,021 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 16:38:58,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:38:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 16:38:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 16:38:58,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:58,022 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:58,023 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:58,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash 530111433, now seen corresponding path program 27 times [2018-10-10 16:38:58,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:58,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:58,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:38:58,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:38:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:38:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:38:58,536 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 31 states. [2018-10-10 16:38:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:59,247 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 16:38:59,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:38:59,248 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2018-10-10 16:38:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:59,248 INFO L225 Difference]: With dead ends: 95 [2018-10-10 16:38:59,248 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 16:38:59,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:38:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 16:38:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-10 16:38:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 16:38:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 16:38:59,252 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-10-10 16:38:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:59,252 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 16:38:59,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:38:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 16:38:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 16:38:59,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:59,253 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:59,253 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:59,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1029741451, now seen corresponding path program 28 times [2018-10-10 16:38:59,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:59,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:59,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:38:59,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:38:59,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:38:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:38:59,758 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 32 states. [2018-10-10 16:39:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:00,530 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 16:39:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:39:00,530 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2018-10-10 16:39:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:00,531 INFO L225 Difference]: With dead ends: 97 [2018-10-10 16:39:00,532 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 16:39:00,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:39:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 16:39:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-10 16:39:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 16:39:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 16:39:00,536 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-10-10 16:39:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:00,536 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 16:39:00,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:39:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 16:39:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 16:39:00,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:00,537 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:00,537 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:00,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 137851597, now seen corresponding path program 29 times [2018-10-10 16:39:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:39:01,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:39:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:39:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:39:01,081 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 33 states. [2018-10-10 16:39:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:01,876 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-10 16:39:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:39:01,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-10-10 16:39:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:01,878 INFO L225 Difference]: With dead ends: 99 [2018-10-10 16:39:01,878 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 16:39:01,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:39:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 16:39:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-10 16:39:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 16:39:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 16:39:01,882 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-10-10 16:39:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:01,882 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 16:39:01,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:39:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 16:39:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 16:39:01,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:01,883 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:01,883 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:01,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2025161103, now seen corresponding path program 30 times [2018-10-10 16:39:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:02,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:02,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:39:02,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:39:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:39:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:39:02,768 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2018-10-10 16:39:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:03,641 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 16:39:03,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:39:03,642 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-10-10 16:39:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:03,642 INFO L225 Difference]: With dead ends: 101 [2018-10-10 16:39:03,642 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 16:39:03,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:39:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 16:39:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-10 16:39:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 16:39:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-10 16:39:03,646 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-10-10 16:39:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:03,647 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-10 16:39:03,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:39:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-10 16:39:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 16:39:03,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:03,648 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:03,648 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:03,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1041569839, now seen corresponding path program 31 times [2018-10-10 16:39:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:04,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:04,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:39:04,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:39:04,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:39:04,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:39:04,305 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 35 states. [2018-10-10 16:39:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:05,158 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 16:39:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:39:05,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-10-10 16:39:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:05,160 INFO L225 Difference]: With dead ends: 103 [2018-10-10 16:39:05,160 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 16:39:05,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:39:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 16:39:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-10 16:39:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 16:39:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 16:39:05,165 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-10-10 16:39:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:05,166 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 16:39:05,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:39:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 16:39:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 16:39:05,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:05,167 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:05,167 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:05,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1822440045, now seen corresponding path program 32 times [2018-10-10 16:39:05,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:39:05,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:39:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:39:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:39:05,772 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 36 states. [2018-10-10 16:39:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:06,697 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-10 16:39:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:39:06,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 101 [2018-10-10 16:39:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:06,698 INFO L225 Difference]: With dead ends: 105 [2018-10-10 16:39:06,699 INFO L226 Difference]: Without dead ends: 105 [2018-10-10 16:39:06,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:39:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-10 16:39:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-10-10 16:39:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 16:39:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 16:39:06,703 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-10-10 16:39:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:06,704 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 16:39:06,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:39:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 16:39:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 16:39:06,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:06,705 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:06,705 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:06,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash -619431211, now seen corresponding path program 33 times [2018-10-10 16:39:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:07,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:07,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:39:07,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:39:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:39:07,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:39:07,562 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 37 states. [2018-10-10 16:39:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:08,801 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 16:39:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:39:08,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2018-10-10 16:39:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:08,803 INFO L225 Difference]: With dead ends: 107 [2018-10-10 16:39:08,803 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 16:39:08,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:39:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 16:39:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-10 16:39:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-10 16:39:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-10 16:39:08,807 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-10-10 16:39:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:08,807 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-10 16:39:08,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:39:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-10 16:39:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 16:39:08,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:08,808 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:08,808 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:08,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash 125855639, now seen corresponding path program 34 times [2018-10-10 16:39:08,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:09,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:09,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:39:09,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:39:09,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:39:09,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:39:09,459 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 38 states. [2018-10-10 16:39:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:10,704 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 16:39:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:39:10,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-10-10 16:39:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:10,706 INFO L225 Difference]: With dead ends: 109 [2018-10-10 16:39:10,706 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 16:39:10,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:39:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 16:39:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-10 16:39:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 16:39:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 16:39:10,709 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-10-10 16:39:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:10,709 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 16:39:10,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:39:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 16:39:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 16:39:10,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:10,710 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:10,710 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:10,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash -913019943, now seen corresponding path program 35 times [2018-10-10 16:39:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:39:11,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:39:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:39:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:39:11,452 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 39 states. [2018-10-10 16:39:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:12,514 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-10 16:39:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:39:12,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 107 [2018-10-10 16:39:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:12,515 INFO L225 Difference]: With dead ends: 111 [2018-10-10 16:39:12,515 INFO L226 Difference]: Without dead ends: 111 [2018-10-10 16:39:12,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:39:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-10 16:39:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-10 16:39:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:39:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 16:39:12,517 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-10-10 16:39:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:12,518 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 16:39:12,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:39:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 16:39:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 16:39:12,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:12,519 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:12,519 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:12,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1454925723, now seen corresponding path program 36 times [2018-10-10 16:39:12,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:13,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:13,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:39:13,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:39:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:39:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:39:13,600 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 40 states. [2018-10-10 16:39:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:14,577 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 16:39:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:39:14,578 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 109 [2018-10-10 16:39:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:14,579 INFO L225 Difference]: With dead ends: 113 [2018-10-10 16:39:14,579 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 16:39:14,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:39:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 16:39:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-10-10 16:39:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 16:39:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-10 16:39:14,582 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-10-10 16:39:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:14,583 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-10 16:39:14,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:39:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-10 16:39:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 16:39:14,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:14,584 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:14,584 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:14,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 718043869, now seen corresponding path program 37 times [2018-10-10 16:39:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:15,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:15,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:39:15,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:39:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:39:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:39:15,407 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 41 states. [2018-10-10 16:39:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:16,477 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 16:39:16,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:39:16,478 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2018-10-10 16:39:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:16,479 INFO L225 Difference]: With dead ends: 115 [2018-10-10 16:39:16,479 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 16:39:16,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:39:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 16:39:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-10 16:39:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 16:39:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 16:39:16,483 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-10-10 16:39:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:16,483 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 16:39:16,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:39:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 16:39:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 16:39:16,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:16,484 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:16,485 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:16,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1244186015, now seen corresponding path program 38 times [2018-10-10 16:39:16,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:18,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:18,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:39:18,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:39:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:39:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:39:18,449 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 42 states. [2018-10-10 16:39:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:20,206 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-10 16:39:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:39:20,210 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 113 [2018-10-10 16:39:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:20,211 INFO L225 Difference]: With dead ends: 117 [2018-10-10 16:39:20,211 INFO L226 Difference]: Without dead ends: 117 [2018-10-10 16:39:20,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:39:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-10 16:39:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-10-10 16:39:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 16:39:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 16:39:20,215 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-10-10 16:39:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:20,215 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 16:39:20,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:39:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 16:39:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 16:39:20,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:20,216 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:20,217 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:20,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash 60647393, now seen corresponding path program 39 times [2018-10-10 16:39:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:21,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:39:21,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:39:21,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:39:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:39:21,874 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 43 states. [2018-10-10 16:39:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:23,204 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-10 16:39:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:39:23,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 115 [2018-10-10 16:39:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:23,206 INFO L225 Difference]: With dead ends: 119 [2018-10-10 16:39:23,206 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 16:39:23,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:39:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 16:39:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-10-10 16:39:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 16:39:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-10 16:39:23,210 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-10-10 16:39:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:23,210 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-10 16:39:23,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:39:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-10 16:39:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 16:39:23,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:23,211 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:23,212 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:23,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 846365091, now seen corresponding path program 40 times [2018-10-10 16:39:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:39:24,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:39:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:39:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:39:24,194 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 44 states. [2018-10-10 16:39:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:25,474 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 16:39:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 16:39:25,475 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-10-10 16:39:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:25,476 INFO L225 Difference]: With dead ends: 121 [2018-10-10 16:39:25,476 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 16:39:25,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:39:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 16:39:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-10-10 16:39:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 16:39:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 16:39:25,481 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-10-10 16:39:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:25,481 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 16:39:25,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:39:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 16:39:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 16:39:25,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:25,482 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:25,482 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 6828773, now seen corresponding path program 41 times [2018-10-10 16:39:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:39:26,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:39:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:39:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:39:26,581 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 45 states. [2018-10-10 16:39:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:27,934 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-10 16:39:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:39:27,934 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-10-10 16:39:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:27,935 INFO L225 Difference]: With dead ends: 123 [2018-10-10 16:39:27,935 INFO L226 Difference]: Without dead ends: 123 [2018-10-10 16:39:27,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:39:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-10 16:39:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-10 16:39:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 16:39:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 16:39:27,939 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-10-10 16:39:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:27,939 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 16:39:27,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:39:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 16:39:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 16:39:27,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:27,940 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:27,940 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:27,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash 666278823, now seen corresponding path program 42 times [2018-10-10 16:39:27,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:29,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:29,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:39:29,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:39:29,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:39:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:39:29,125 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 46 states. [2018-10-10 16:39:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:32,698 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 16:39:32,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:39:32,699 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-10-10 16:39:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:32,700 INFO L225 Difference]: With dead ends: 125 [2018-10-10 16:39:32,700 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 16:39:32,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 16:39:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 16:39:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-10-10 16:39:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-10 16:39:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-10 16:39:32,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-10-10 16:39:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:32,703 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-10 16:39:32,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:39:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-10 16:39:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 16:39:32,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:32,704 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:32,704 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1257382935, now seen corresponding path program 43 times [2018-10-10 16:39:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:34,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:34,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:39:34,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:39:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:39:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:39:34,151 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 47 states. [2018-10-10 16:39:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:35,781 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-10 16:39:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 16:39:35,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 123 [2018-10-10 16:39:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:35,783 INFO L225 Difference]: With dead ends: 127 [2018-10-10 16:39:35,783 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 16:39:35,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 16:39:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 16:39:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-10-10 16:39:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 16:39:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 16:39:35,787 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-10-10 16:39:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:35,787 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 16:39:35,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:39:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 16:39:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 16:39:35,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:35,788 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:35,788 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:35,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1234572203, now seen corresponding path program 44 times [2018-10-10 16:39:35,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:36,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:36,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:39:36,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:39:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:39:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:39:36,885 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 48 states. [2018-10-10 16:39:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:38,312 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-10 16:39:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:39:38,312 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 125 [2018-10-10 16:39:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:38,313 INFO L225 Difference]: With dead ends: 129 [2018-10-10 16:39:38,313 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 16:39:38,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 16:39:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 16:39:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-10-10 16:39:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 16:39:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-10 16:39:38,317 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-10-10 16:39:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:38,317 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-10 16:39:38,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:39:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-10 16:39:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 16:39:38,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:38,318 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:38,318 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:38,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash -588291347, now seen corresponding path program 45 times [2018-10-10 16:39:38,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:39,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:39:39,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:39:39,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:39:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:39:39,546 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-10-10 16:39:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:41,038 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 16:39:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:39:41,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 127 [2018-10-10 16:39:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:41,039 INFO L225 Difference]: With dead ends: 131 [2018-10-10 16:39:41,040 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 16:39:41,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:39:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 16:39:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-10-10 16:39:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 16:39:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-10 16:39:41,043 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-10-10 16:39:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:41,043 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-10 16:39:41,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:39:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-10 16:39:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 16:39:41,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:41,044 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:41,044 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:41,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash -13506129, now seen corresponding path program 46 times [2018-10-10 16:39:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:46,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:46,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:39:46,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:39:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:39:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:39:46,585 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 50 states. [2018-10-10 16:39:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:48,223 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-10 16:39:48,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:39:48,223 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 129 [2018-10-10 16:39:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:48,224 INFO L225 Difference]: With dead ends: 133 [2018-10-10 16:39:48,224 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 16:39:48,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 16:39:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 16:39:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-10 16:39:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 16:39:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 16:39:48,226 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-10-10 16:39:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:48,227 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 16:39:48,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:39:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 16:39:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 16:39:48,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:48,228 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:48,228 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:48,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1695692815, now seen corresponding path program 47 times [2018-10-10 16:39:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:49,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:49,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:39:49,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:39:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:39:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:39:49,857 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 51 states. [2018-10-10 16:39:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:51,373 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-10 16:39:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:39:51,374 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 131 [2018-10-10 16:39:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:51,375 INFO L225 Difference]: With dead ends: 135 [2018-10-10 16:39:51,375 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 16:39:51,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 16:39:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 16:39:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-10 16:39:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 16:39:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-10 16:39:51,379 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-10-10 16:39:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:51,379 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-10 16:39:51,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:39:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-10 16:39:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 16:39:51,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:51,380 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:51,381 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:51,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 925572531, now seen corresponding path program 48 times [2018-10-10 16:39:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:52,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:52,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:39:52,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:39:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:39:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:39:52,702 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 52 states. [2018-10-10 16:39:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:54,621 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 16:39:54,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:39:54,621 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 133 [2018-10-10 16:39:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:54,622 INFO L225 Difference]: With dead ends: 137 [2018-10-10 16:39:54,622 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 16:39:54,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 16:39:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 16:39:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-10-10 16:39:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 16:39:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-10 16:39:54,626 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-10-10 16:39:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:54,626 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-10 16:39:54,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:39:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-10 16:39:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 16:39:54,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:54,628 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:54,628 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:54,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1184232715, now seen corresponding path program 49 times [2018-10-10 16:39:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:39:55,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:39:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:39:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:39:55,897 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 53 states. [2018-10-10 16:39:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:57,674 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-10 16:39:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:39:57,674 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 135 [2018-10-10 16:39:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:57,675 INFO L225 Difference]: With dead ends: 139 [2018-10-10 16:39:57,675 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 16:39:57,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 16:39:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 16:39:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-10 16:39:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 16:39:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 16:39:57,679 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-10-10 16:39:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:57,679 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 16:39:57,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:39:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 16:39:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 16:39:57,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:57,680 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:39:57,680 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:57,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:57,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1482510409, now seen corresponding path program 50 times [2018-10-10 16:39:57,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:59,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:59,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:39:59,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:39:59,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:39:59,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:39:59,210 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 54 states. [2018-10-10 16:40:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:01,156 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 16:40:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:40:01,156 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 137 [2018-10-10 16:40:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:01,157 INFO L225 Difference]: With dead ends: 141 [2018-10-10 16:40:01,157 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 16:40:01,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 16:40:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 16:40:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-10-10 16:40:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 16:40:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-10 16:40:01,160 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-10-10 16:40:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:01,160 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-10 16:40:01,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:40:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-10 16:40:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 16:40:01,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:01,162 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:01,162 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:01,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash -364565511, now seen corresponding path program 51 times [2018-10-10 16:40:01,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:02,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:02,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:40:02,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:40:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:40:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:40:02,504 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 55 states. [2018-10-10 16:40:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:04,684 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 16:40:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:40:04,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 139 [2018-10-10 16:40:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:04,685 INFO L225 Difference]: With dead ends: 143 [2018-10-10 16:40:04,685 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 16:40:04,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 16:40:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 16:40:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-10 16:40:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 16:40:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-10 16:40:04,689 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-10-10 16:40:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:04,690 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-10 16:40:04,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:40:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-10 16:40:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-10 16:40:04,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:04,691 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:04,691 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 238657467, now seen corresponding path program 52 times [2018-10-10 16:40:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:40:06,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:40:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:40:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:40:06,457 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 56 states. [2018-10-10 16:40:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:08,443 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-10 16:40:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:40:08,444 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 141 [2018-10-10 16:40:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:08,444 INFO L225 Difference]: With dead ends: 145 [2018-10-10 16:40:08,445 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 16:40:08,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 16:40:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 16:40:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-10 16:40:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 16:40:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 16:40:08,448 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-10-10 16:40:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:08,448 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 16:40:08,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:40:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 16:40:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 16:40:08,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:08,449 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:08,449 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:08,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash 115354365, now seen corresponding path program 53 times [2018-10-10 16:40:08,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:10,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:10,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 16:40:10,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 16:40:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 16:40:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:40:10,359 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 57 states. [2018-10-10 16:40:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:12,406 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-10 16:40:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 16:40:12,406 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 143 [2018-10-10 16:40:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:12,407 INFO L225 Difference]: With dead ends: 147 [2018-10-10 16:40:12,407 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 16:40:12,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 16:40:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 16:40:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-10 16:40:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 16:40:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-10 16:40:12,410 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-10-10 16:40:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:12,410 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-10 16:40:12,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 16:40:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-10 16:40:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 16:40:12,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:12,411 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:12,411 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:12,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1880157631, now seen corresponding path program 54 times [2018-10-10 16:40:12,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:14,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:14,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:40:14,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:40:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:40:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:40:14,028 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 58 states. [2018-10-10 16:40:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:16,411 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 16:40:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 16:40:16,411 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 145 [2018-10-10 16:40:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:16,412 INFO L225 Difference]: With dead ends: 149 [2018-10-10 16:40:16,412 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 16:40:16,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 16:40:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 16:40:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-10-10 16:40:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 16:40:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-10 16:40:16,415 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-10-10 16:40:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:16,415 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-10 16:40:16,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:40:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-10 16:40:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 16:40:16,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:16,416 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:16,416 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:16,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1344014337, now seen corresponding path program 55 times [2018-10-10 16:40:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:17,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:40:17,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:40:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:40:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:40:17,943 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 59 states. [2018-10-10 16:40:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:20,433 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-10 16:40:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:40:20,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 147 [2018-10-10 16:40:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:20,434 INFO L225 Difference]: With dead ends: 151 [2018-10-10 16:40:20,434 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 16:40:20,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 16:40:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 16:40:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-10-10 16:40:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 16:40:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 16:40:20,437 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-10-10 16:40:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:20,437 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 16:40:20,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:40:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 16:40:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 16:40:20,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:20,438 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:20,438 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:20,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:20,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1506384323, now seen corresponding path program 56 times [2018-10-10 16:40:20,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:22,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:22,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:40:22,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:40:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:40:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:40:22,008 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 60 states. [2018-10-10 16:40:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:24,138 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-10 16:40:24,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 16:40:24,138 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 149 [2018-10-10 16:40:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:24,139 INFO L225 Difference]: With dead ends: 153 [2018-10-10 16:40:24,139 INFO L226 Difference]: Without dead ends: 153 [2018-10-10 16:40:24,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 16:40:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-10 16:40:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-10-10 16:40:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 16:40:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-10 16:40:24,144 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-10-10 16:40:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:24,144 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-10 16:40:24,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:40:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-10 16:40:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 16:40:24,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:24,145 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:24,145 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:24,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1369849083, now seen corresponding path program 57 times [2018-10-10 16:40:24,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:26,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:26,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 16:40:26,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 16:40:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 16:40:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:40:26,037 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 61 states. [2018-10-10 16:40:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:28,326 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 16:40:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:40:28,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 151 [2018-10-10 16:40:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:28,327 INFO L225 Difference]: With dead ends: 155 [2018-10-10 16:40:28,327 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 16:40:28,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 16:40:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 16:40:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-10-10 16:40:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 16:40:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-10 16:40:28,331 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-10-10 16:40:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:28,331 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-10 16:40:28,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 16:40:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-10 16:40:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 16:40:28,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:28,332 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:28,333 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:28,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash 528786375, now seen corresponding path program 58 times [2018-10-10 16:40:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:30,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:30,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:40:30,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:40:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:40:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:40:30,558 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 62 states. [2018-10-10 16:40:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:32,979 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-10 16:40:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 16:40:32,979 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 153 [2018-10-10 16:40:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:32,980 INFO L225 Difference]: With dead ends: 157 [2018-10-10 16:40:32,980 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 16:40:32,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 16:40:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 16:40:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-10-10 16:40:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 16:40:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 16:40:32,983 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-10-10 16:40:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:32,983 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 16:40:32,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:40:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 16:40:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 16:40:32,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:32,984 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:32,984 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:32,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash -243639287, now seen corresponding path program 59 times [2018-10-10 16:40:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 16:40:34,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 16:40:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 16:40:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:40:34,829 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 63 states. [2018-10-10 16:40:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:37,380 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-10 16:40:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 16:40:37,380 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 155 [2018-10-10 16:40:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:37,381 INFO L225 Difference]: With dead ends: 159 [2018-10-10 16:40:37,381 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 16:40:37,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 16:40:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 16:40:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-10 16:40:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 16:40:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-10 16:40:37,384 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-10-10 16:40:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:37,384 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-10 16:40:37,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 16:40:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-10 16:40:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 16:40:37,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:37,385 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:37,385 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:37,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash 484641739, now seen corresponding path program 60 times [2018-10-10 16:40:37,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:39,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:40:39,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:40:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:40:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:40:39,424 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 64 states. [2018-10-10 16:40:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:42,234 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 16:40:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 16:40:42,234 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 157 [2018-10-10 16:40:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:42,235 INFO L225 Difference]: With dead ends: 161 [2018-10-10 16:40:42,235 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 16:40:42,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:40:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 16:40:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-10-10 16:40:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 16:40:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-10 16:40:42,238 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-10-10 16:40:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:42,238 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-10 16:40:42,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:40:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-10 16:40:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 16:40:42,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:42,239 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:42,239 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:42,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 283038477, now seen corresponding path program 61 times [2018-10-10 16:40:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:44,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:44,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 16:40:44,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 16:40:44,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 16:40:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:40:44,087 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 65 states. [2018-10-10 16:40:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:46,895 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-10 16:40:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 16:40:46,896 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 159 [2018-10-10 16:40:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:46,897 INFO L225 Difference]: With dead ends: 163 [2018-10-10 16:40:46,897 INFO L226 Difference]: Without dead ends: 163 [2018-10-10 16:40:46,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 16:40:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-10 16:40:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-10-10 16:40:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 16:40:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 16:40:46,903 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-10-10 16:40:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:46,903 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 16:40:46,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 16:40:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 16:40:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 16:40:46,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:46,905 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:46,905 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:46,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash -184167985, now seen corresponding path program 62 times [2018-10-10 16:40:46,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:48,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:48,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:40:48,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:40:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:40:48,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:40:48,686 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 66 states. [2018-10-10 16:40:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:51,576 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-10 16:40:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:40:51,576 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 161 [2018-10-10 16:40:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:51,577 INFO L225 Difference]: With dead ends: 165 [2018-10-10 16:40:51,577 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 16:40:51,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 16:40:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 16:40:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-10-10 16:40:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 16:40:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-10 16:40:51,580 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-10-10 16:40:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:51,581 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-10 16:40:51,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:40:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-10 16:40:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 16:40:51,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:51,582 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:51,582 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1801988113, now seen corresponding path program 63 times [2018-10-10 16:40:51,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:53,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:53,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 16:40:53,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 16:40:53,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 16:40:53,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:40:53,396 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 67 states. [2018-10-10 16:40:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:40:56,377 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 16:40:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:40:56,377 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 163 [2018-10-10 16:40:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:40:56,378 INFO L225 Difference]: With dead ends: 167 [2018-10-10 16:40:56,378 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 16:40:56,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 16:40:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 16:40:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-10-10 16:40:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-10 16:40:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-10 16:40:56,382 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-10-10 16:40:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:40:56,382 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-10 16:40:56,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 16:40:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-10 16:40:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 16:40:56,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:40:56,384 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:40:56,384 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:40:56,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:40:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash -762448429, now seen corresponding path program 64 times [2018-10-10 16:40:56,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:40:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:40:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:40:58,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:40:58,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 16:40:58,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 16:40:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 16:40:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:40:58,309 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 68 states. [2018-10-10 16:41:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:01,394 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 16:41:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 16:41:01,394 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 165 [2018-10-10 16:41:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:01,395 INFO L225 Difference]: With dead ends: 169 [2018-10-10 16:41:01,395 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 16:41:01,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 16:41:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 16:41:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-10-10 16:41:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 16:41:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 16:41:01,398 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-10-10 16:41:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:01,398 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 16:41:01,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 16:41:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 16:41:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 16:41:01,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:01,399 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:01,399 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:01,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash 125262613, now seen corresponding path program 65 times [2018-10-10 16:41:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:03,551 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 16:41:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 16:41:03,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 16:41:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 16:41:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:41:03,553 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 69 states. [2018-10-10 16:41:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:06,634 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-10 16:41:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 16:41:06,634 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 167 [2018-10-10 16:41:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:06,635 INFO L225 Difference]: With dead ends: 171 [2018-10-10 16:41:06,635 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 16:41:06,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 16:41:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 16:41:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-10 16:41:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 16:41:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-10 16:41:06,638 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-10-10 16:41:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:06,638 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-10 16:41:06,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 16:41:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-10 16:41:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 16:41:06,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:06,639 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:06,639 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:06,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1482917929, now seen corresponding path program 66 times [2018-10-10 16:41:06,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:08,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 16:41:08,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 16:41:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 16:41:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:41:08,635 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 70 states. [2018-10-10 16:41:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:11,745 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 16:41:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 16:41:11,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 169 [2018-10-10 16:41:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:11,747 INFO L225 Difference]: With dead ends: 173 [2018-10-10 16:41:11,747 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 16:41:11,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 16:41:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 16:41:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-10-10 16:41:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 16:41:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-10 16:41:11,751 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-10-10 16:41:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:11,751 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-10 16:41:11,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 16:41:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-10 16:41:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-10 16:41:11,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:11,752 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:11,752 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:11,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -756192231, now seen corresponding path program 67 times [2018-10-10 16:41:11,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:13,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 16:41:13,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 16:41:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 16:41:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:41:13,818 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 71 states. [2018-10-10 16:41:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:17,164 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-10 16:41:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 16:41:17,165 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 171 [2018-10-10 16:41:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:17,166 INFO L225 Difference]: With dead ends: 175 [2018-10-10 16:41:17,166 INFO L226 Difference]: Without dead ends: 175 [2018-10-10 16:41:17,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:41:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-10 16:41:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-10-10 16:41:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 16:41:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 16:41:17,169 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-10-10 16:41:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:17,169 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 16:41:17,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 16:41:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 16:41:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 16:41:17,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:17,170 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:17,170 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:17,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1842501595, now seen corresponding path program 68 times [2018-10-10 16:41:17,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:19,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:19,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 16:41:19,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 16:41:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 16:41:19,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:41:19,285 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 72 states. [2018-10-10 16:41:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:22,699 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-10 16:41:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:41:22,699 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 173 [2018-10-10 16:41:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:22,700 INFO L225 Difference]: With dead ends: 177 [2018-10-10 16:41:22,700 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 16:41:22,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 16:41:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 16:41:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-10-10 16:41:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-10 16:41:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-10 16:41:22,703 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-10-10 16:41:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:22,704 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-10 16:41:22,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 16:41:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-10 16:41:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-10 16:41:22,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:22,705 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:22,705 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:22,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash -483697891, now seen corresponding path program 69 times [2018-10-10 16:41:22,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:24,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:24,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 16:41:24,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 16:41:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 16:41:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:41:24,944 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 73 states. [2018-10-10 16:41:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:28,296 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 16:41:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:41:28,297 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 175 [2018-10-10 16:41:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:28,298 INFO L225 Difference]: With dead ends: 179 [2018-10-10 16:41:28,298 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 16:41:28,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 16:41:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 16:41:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-10-10 16:41:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 16:41:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-10 16:41:28,303 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-10-10 16:41:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:28,304 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-10 16:41:28,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 16:41:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-10 16:41:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 16:41:28,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:28,305 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:28,305 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:28,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1716557279, now seen corresponding path program 70 times [2018-10-10 16:41:28,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 16:41:30,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 16:41:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 16:41:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:41:30,552 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 74 states. [2018-10-10 16:41:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:34,181 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-10 16:41:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 16:41:34,181 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 177 [2018-10-10 16:41:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:34,182 INFO L225 Difference]: With dead ends: 181 [2018-10-10 16:41:34,182 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 16:41:34,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 16:41:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 16:41:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-10-10 16:41:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 16:41:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 16:41:34,186 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-10-10 16:41:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:34,186 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 16:41:34,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 16:41:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 16:41:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 16:41:34,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:34,187 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:34,187 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:34,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1257101279, now seen corresponding path program 71 times [2018-10-10 16:41:34,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:36,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:36,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 16:41:36,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 16:41:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 16:41:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:41:36,774 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 75 states. [2018-10-10 16:41:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:40,376 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-10 16:41:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 16:41:40,376 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 179 [2018-10-10 16:41:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:40,377 INFO L225 Difference]: With dead ends: 183 [2018-10-10 16:41:40,377 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 16:41:40,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:41:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 16:41:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-10 16:41:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 16:41:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-10 16:41:40,379 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-10-10 16:41:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:40,380 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-10 16:41:40,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 16:41:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-10 16:41:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-10 16:41:40,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:40,381 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:40,381 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:40,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1505243619, now seen corresponding path program 72 times [2018-10-10 16:41:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:43,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:43,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 16:41:43,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 16:41:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 16:41:43,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:41:43,027 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-10 16:41:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:46,754 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 16:41:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 16:41:46,754 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-10 16:41:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:46,755 INFO L225 Difference]: With dead ends: 185 [2018-10-10 16:41:46,755 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 16:41:46,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 16:41:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 16:41:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-10-10 16:41:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 16:41:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-10 16:41:46,758 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-10-10 16:41:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:46,759 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-10 16:41:46,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 16:41:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-10 16:41:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 16:41:46,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:46,760 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:41:46,760 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:46,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1828901669, now seen corresponding path program 73 times [2018-10-10 16:41:46,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:49,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:49,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 16:41:49,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 16:41:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 16:41:49,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:41:49,174 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 77 states. [2018-10-10 16:41:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:52,849 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-10 16:41:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 16:41:52,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 183 [2018-10-10 16:41:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:52,850 INFO L225 Difference]: With dead ends: 187 [2018-10-10 16:41:52,851 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 16:41:52,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 16:41:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 16:41:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-10 16:41:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 16:41:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 16:41:52,853 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-10-10 16:41:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:52,854 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 16:41:52,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 16:41:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 16:41:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 16:41:52,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:52,855 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 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 16:41:52,855 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:52,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -668324889, now seen corresponding path program 74 times [2018-10-10 16:41:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:41:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:41:55,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:41:55,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 16:41:55,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 16:41:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 16:41:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:41:55,239 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-10-10 16:41:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:41:59,133 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-10 16:41:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:41:59,133 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-10-10 16:41:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:41:59,134 INFO L225 Difference]: With dead ends: 189 [2018-10-10 16:41:59,134 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 16:41:59,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 16:41:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 16:41:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-10-10 16:41:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 16:41:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-10 16:41:59,137 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-10-10 16:41:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:41:59,138 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-10 16:41:59,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 16:41:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-10 16:41:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-10 16:41:59,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:41:59,139 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 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 16:41:59,139 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:41:59,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:41:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash 383671337, now seen corresponding path program 75 times [2018-10-10 16:41:59,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:41:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:42:01,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:42:01,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 16:42:01,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 16:42:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 16:42:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:42:01,612 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 79 states. [2018-10-10 16:42:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:05,466 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 16:42:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 16:42:05,466 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 187 [2018-10-10 16:42:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:05,467 INFO L225 Difference]: With dead ends: 191 [2018-10-10 16:42:05,467 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 16:42:05,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 16:42:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 16:42:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-10-10 16:42:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 16:42:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-10 16:42:05,470 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-10-10 16:42:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:05,471 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-10 16:42:05,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 16:42:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-10 16:42:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 16:42:05,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:42:05,472 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 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 16:42:05,472 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:42:05,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:42:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2034729963, now seen corresponding path program 76 times [2018-10-10 16:42:05,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:42:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:42:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:42:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 16:42:08,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 16:42:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 16:42:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:42:08,426 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 80 states. [2018-10-10 16:42:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:12,355 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-10 16:42:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 16:42:12,356 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 189 [2018-10-10 16:42:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:12,357 INFO L225 Difference]: With dead ends: 193 [2018-10-10 16:42:12,357 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 16:42:12,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 16:42:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 16:42:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-10-10 16:42:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 16:42:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 16:42:12,361 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-10-10 16:42:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:12,361 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 16:42:12,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 16:42:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 16:42:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 16:42:12,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:42:12,362 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 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 16:42:12,363 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:42:12,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:42:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash -435829971, now seen corresponding path program 77 times [2018-10-10 16:42:12,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:42:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:42:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:42:15,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 16:42:15,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 16:42:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 16:42:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:42:15,007 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 81 states. [2018-10-10 16:42:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:19,024 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-10 16:42:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:42:19,025 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 191 [2018-10-10 16:42:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:19,026 INFO L225 Difference]: With dead ends: 195 [2018-10-10 16:42:19,026 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 16:42:19,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 16:42:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 16:42:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-10 16:42:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 16:42:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-10 16:42:19,029 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-10-10 16:42:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:19,029 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-10 16:42:19,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 16:42:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-10 16:42:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-10 16:42:19,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:42:19,031 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 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 16:42:19,031 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:42:19,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:42:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 472988143, now seen corresponding path program 78 times [2018-10-10 16:42:19,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:42:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:42:21,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:42:21,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 16:42:21,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 16:42:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 16:42:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:42:21,723 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 82 states. [2018-10-10 16:42:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:25,727 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 16:42:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:42:25,728 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 193 [2018-10-10 16:42:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:25,728 INFO L225 Difference]: With dead ends: 197 [2018-10-10 16:42:25,729 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 16:42:25,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 16:42:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 16:42:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-10-10 16:42:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 16:42:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-10 16:42:25,732 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-10-10 16:42:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:25,732 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-10 16:42:25,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 16:42:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-10 16:42:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-10 16:42:25,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:42:25,733 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 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 16:42:25,733 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:42:25,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:42:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1968834609, now seen corresponding path program 79 times [2018-10-10 16:42:25,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:42:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:42:28,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:42:28,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 16:42:28,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 16:42:28,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 16:42:28,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:42:28,848 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 83 states. [2018-10-10 16:42:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:33,157 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-10 16:42:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 16:42:33,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 195 [2018-10-10 16:42:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:33,159 INFO L225 Difference]: With dead ends: 198 [2018-10-10 16:42:33,159 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 16:42:33,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 16:42:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 16:42:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-10 16:42:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 16:42:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 16:42:33,162 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-10-10 16:42:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:33,162 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 16:42:33,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 16:42:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 16:42:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 16:42:33,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:42:33,163 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 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 16:42:33,163 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:42:33,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:42:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash 663244275, now seen corresponding path program 80 times [2018-10-10 16:42:33,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:42:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:42:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2018-10-10 16:42:33,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:42:33,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 16:42:33,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:42:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:42:33,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:42:33,701 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 9 states. [2018-10-10 16:42:34,583 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:42:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:42:34,668 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-10 16:42:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:42:34,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2018-10-10 16:42:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:42:34,669 INFO L225 Difference]: With dead ends: 196 [2018-10-10 16:42:34,669 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:42:34,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:42:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:42:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:42:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:42:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:42:34,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2018-10-10 16:42:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:42:34,671 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:42:34,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:42:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:42:34,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:42:34,674 INFO L202 PluginConnector]: Adding new model memset3_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:42:34 BasicIcfg [2018-10-10 16:42:34,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:42:34,676 INFO L168 Benchmark]: Toolchain (without parser) took 240268.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 668.5 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -443.3 MB). Peak memory consumption was 225.2 MB. Max. memory is 7.1 GB. [2018-10-10 16:42:34,677 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:42:34,677 INFO L168 Benchmark]: Boogie Preprocessor took 63.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:42:34,677 INFO L168 Benchmark]: RCFGBuilder took 528.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 16:42:34,678 INFO L168 Benchmark]: IcfgTransformer took 1151.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-10-10 16:42:34,679 INFO L168 Benchmark]: TraceAbstraction took 238515.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 668.5 MB). Free memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: -644.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-10-10 16:42:34,682 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 528.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 1151.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238515.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 668.5 MB). Free memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: -644.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 548 LocStat_NO_SUPPORTING_DISEQUALITIES : 114 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 40 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 865.35 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 70 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 41 different actions 70 times. Merged at 14 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. SAFE Result, 238.4s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 135.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2745 SDtfs, 7765 SDslu, 74833 SDs, 0 SdLazy, 18888 SolverSat, 3363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6658 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85339 ImplicationChecksByTransitivity, 209.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 81 MinimizatonAttempts, 79 StatesRemovedByMinimization, 79 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 100.0s InterpolantComputationTime, 9477 NumberOfCodeBlocks, 9477 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 9396 ConstructedInterpolants, 0 QuantifiedInterpolants, 5243580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 81 InterpolantComputations, 2 PerfectInterpolantSequences, 6400/173880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset3_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-42-34-694.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset3_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-42-34-694.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset3_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-42-34-694.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...