java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_762_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:09:46,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:09:46,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:09:46,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:09:46,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:09:46,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:09:46,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:09:46,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:09:46,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:09:46,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:09:46,174 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:09:46,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:09:46,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:09:46,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:09:46,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:09:46,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:09:46,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:09:46,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:09:46,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:09:46,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:09:46,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:09:46,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:09:46,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:09:46,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:09:46,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:09:46,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:09:46,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:09:46,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:09:46,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:09:46,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:09:46,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:09:46,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:09:46,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:09:46,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:09:46,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:09:46,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:09:46,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:09:46,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:09:46,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:09:46,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:09:46,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:09:46,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:09:46,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:09:46,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:09:46,248 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:09:46,249 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:09:46,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_762_5.bpl [2019-08-05 10:09:46,250 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_762_5.bpl' [2019-08-05 10:09:46,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:09:46,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:09:46,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:46,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:09:46,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:09:46,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,423 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:09:46,423 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:09:46,424 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:09:46,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:46,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:09:46,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:09:46,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:09:46,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/1) ... [2019-08-05 10:09:46,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:09:46,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:09:46,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:09:46,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:09:46,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (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 [2019-08-05 10:09:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:09:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:09:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:09:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:09:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:09:46,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:09:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:09:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:09:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:09:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:09:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:09:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:09:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:09:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:09:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:09:46,834 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:09:50,883 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:09:50,883 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:09:50,884 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:50 BoogieIcfgContainer [2019-08-05 10:09:50,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:09:50,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:09:50,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:09:50,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:09:50,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:46" (1/2) ... [2019-08-05 10:09:50,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1a088 and model type u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:09:50, skipping insertion in model container [2019-08-05 10:09:50,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:50" (2/2) ... [2019-08-05 10:09:50,894 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_762_5.bpl [2019-08-05 10:09:50,904 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:09:50,914 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:09:50,932 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:09:50,959 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:09:50,960 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:09:50,960 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:09:50,960 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:09:50,960 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:09:50,961 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:09:50,961 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:09:50,961 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:09:50,961 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:09:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:09:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:09:50,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:50,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:09:50,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:09:51,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:51,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:51,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:09:51,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:51,234 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:09:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:51,325 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:09:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:51,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:09:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:51,341 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:09:51,341 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:09:51,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:09:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:09:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:09:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:09:51,391 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:09:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:51,391 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:09:51,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:09:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:51,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:51,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:51,393 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:09:51,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:51,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:51,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:51,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:51,514 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:09:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:51,925 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:09:51,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:51,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:09:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:51,928 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:09:51,929 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:09:51,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:09:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:09:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:09:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:09:51,949 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:09:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:51,949 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:09:51,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:09:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:09:51,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:51,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:51,954 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:09:51,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:52,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:52,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:52,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,112 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:09:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:52,154 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:09:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:52,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:09:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:52,159 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:09:52,160 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:09:52,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:09:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:09:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:09:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:09:52,184 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:09:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:52,184 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:09:52,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:09:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:09:52,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:52,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:52,186 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:09:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:52,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:52,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:52,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,261 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:09:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:52,332 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:09:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:52,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:09:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:52,336 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:09:52,337 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:09:52,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:09:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:09:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:09:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:09:52,392 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:09:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:52,392 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:09:52,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:09:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:52,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:52,394 INFO L399 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] [2019-08-05 10:09:52,394 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:09:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:52,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,503 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:09:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:52,639 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:09:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:52,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:09:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:52,669 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:09:52,671 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:09:52,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:09:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:09:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:09:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:09:52,694 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:09:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:52,695 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:09:52,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:09:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:09:52,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:52,696 INFO L399 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] [2019-08-05 10:09:52,696 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:09:52,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:52,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:52,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:52,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:52,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,756 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:09:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:53,115 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:09:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:53,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:09:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:53,127 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:09:53,128 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:09:53,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:09:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:09:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:09:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:09:53,169 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:09:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:53,169 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:09:53,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:09:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:53,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:53,171 INFO L399 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] [2019-08-05 10:09:53,171 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:09:53,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:53,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:53,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,620 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:09:54,257 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:09:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:54,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:54,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:54,341 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:09:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:54,824 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:09:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:54,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:09:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:54,834 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:09:54,835 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:09:54,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:09:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:09:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:09:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:09:54,877 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:09:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:54,877 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:09:54,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:09:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:09:54,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:54,883 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:54,883 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:09:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:54,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:54,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:55,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:55,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:55,031 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:09:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:56,165 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:09:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:56,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:09:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:56,188 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:09:56,188 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:09:56,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:09:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:09:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:09:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:09:56,253 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:09:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:56,255 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:09:56,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:09:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:09:56,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:56,290 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:56,290 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:56,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:09:56,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:56,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:56,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:56,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:56,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:56,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:56,404 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:09:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:56,624 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:09:56,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:56,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:09:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:56,643 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:09:56,643 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:09:56,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:09:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:09:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:09:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:09:56,716 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:09:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:56,716 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:09:56,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:09:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:09:56,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:56,718 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:56,718 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:09:56,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:56,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:56,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:56,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:56,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:56,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:56,784 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:09:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:56,936 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:09:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:56,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:09:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:56,954 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:09:56,954 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:09:56,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:09:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:09:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:09:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:09:57,019 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:09:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:57,019 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:09:57,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:09:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:57,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:57,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:57,023 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:09:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:57,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:57,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:57,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:57,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:57,358 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:09:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:58,079 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:09:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:58,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:09:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:58,101 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:09:58,102 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:09:58,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:09:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:09:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:09:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:09:58,218 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:09:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:58,219 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:09:58,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:09:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:58,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:58,221 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:58,221 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:09:58,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:58,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:58,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:58,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,897 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:59,413 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:59,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,632 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:59,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:59,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:59,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:59,660 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:10:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:00,030 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:10:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:00,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:10:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:00,052 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:10:00,052 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:10:00,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:10:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:10:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:10:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:10:00,126 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:10:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:00,126 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:10:00,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:10:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:10:00,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:00,127 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:00,127 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:10:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:00,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:10:00,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:00,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:10:00,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:00,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:00,339 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:10:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:00,938 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:10:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:00,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:10:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:00,951 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:10:00,951 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:10:00,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:10:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:10:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:10:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:10:01,033 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:10:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:01,033 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:10:01,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:10:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:10:01,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:01,035 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:01,035 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:10:01,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:01,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:10:01,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:01,241 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:10:01,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,734 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:02,364 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:02,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:10:02,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:02,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:02,594 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:10:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:03,032 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:10:03,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:10:03,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:10:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:03,042 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:10:03,042 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:10:03,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:10:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:10:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:10:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:10:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:10:03,109 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:10:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:03,110 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:10:03,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:10:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:10:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:10:03,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:03,111 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:03,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:10:03,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:03,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:10:03,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:03,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,663 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:03,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:03,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:03,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:10:03,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:03,917 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:10:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:04,283 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:10:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:04,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:10:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:04,292 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:10:04,293 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:10:04,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:10:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:10:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:10:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:10:04,359 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:10:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:04,359 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:10:04,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:10:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:10:04,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:04,361 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:04,362 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:10:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:04,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:10:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:04,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:10:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:10:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:10:04,511 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:10:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:05,090 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:10:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:05,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:10:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:05,110 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:10:05,110 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:10:05,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:10:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:10:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:10:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:10:05,250 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:10:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:05,250 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:10:05,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:10:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:10:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:10:05,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:05,253 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:05,253 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:10:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:05,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:05,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:05,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:05,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:05,375 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:10:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:05,573 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:10:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:05,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:10:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:05,665 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:10:05,666 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:10:05,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:10:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:10:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:10:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:10:05,854 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:10:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:05,854 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:10:05,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:10:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:10:05,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:05,857 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:05,858 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:10:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:05,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:05,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:05,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:05,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:05,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:05,997 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:10:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:06,414 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:10:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:10:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:06,435 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:10:06,435 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:10:06,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:10:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:10:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:10:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:10:07,148 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:10:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:07,149 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:10:07,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:10:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:10:07,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:07,151 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:07,152 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:10:07,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:07,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:10:07,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:07,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,641 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:07,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,964 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:10:07,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,167 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 9 [2019-08-05 10:10:08,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:08,670 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:09,114 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:09,369 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:09,640 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:09,879 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:10,104 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:10,361 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:10,546 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:10,701 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:10,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:10,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:10:10,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:10:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:10:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:10:10,832 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 20 states. [2019-08-05 10:10:11,577 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-08-05 10:10:12,137 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:10:12,602 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-08-05 10:10:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:12,862 INFO L93 Difference]: Finished difference Result 21935 states and 30075 transitions. [2019-08-05 10:10:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:10:12,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:10:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:12,954 INFO L225 Difference]: With dead ends: 21935 [2019-08-05 10:10:12,955 INFO L226 Difference]: Without dead ends: 21935 [2019-08-05 10:10:12,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:10:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2019-08-05 10:10:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21838. [2019-08-05 10:10:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21838 states. [2019-08-05 10:10:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21838 states to 21838 states and 29978 transitions. [2019-08-05 10:10:13,166 INFO L78 Accepts]: Start accepts. Automaton has 21838 states and 29978 transitions. Word has length 139 [2019-08-05 10:10:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:13,167 INFO L475 AbstractCegarLoop]: Abstraction has 21838 states and 29978 transitions. [2019-08-05 10:10:13,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:10:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21838 states and 29978 transitions. [2019-08-05 10:10:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:10:13,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:13,170 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:13,170 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:10:13,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:13,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:10:13,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:13,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:10:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:13,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:13,798 INFO L87 Difference]: Start difference. First operand 21838 states and 29978 transitions. Second operand 7 states. [2019-08-05 10:10:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:14,194 INFO L93 Difference]: Finished difference Result 23920 states and 32548 transitions. [2019-08-05 10:10:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:14,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:10:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:14,217 INFO L225 Difference]: With dead ends: 23920 [2019-08-05 10:10:14,218 INFO L226 Difference]: Without dead ends: 23920 [2019-08-05 10:10:14,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23920 states. [2019-08-05 10:10:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23920 to 23546. [2019-08-05 10:10:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23546 states. [2019-08-05 10:10:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23546 states to 23546 states and 32116 transitions. [2019-08-05 10:10:15,144 INFO L78 Accepts]: Start accepts. Automaton has 23546 states and 32116 transitions. Word has length 143 [2019-08-05 10:10:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:15,144 INFO L475 AbstractCegarLoop]: Abstraction has 23546 states and 32116 transitions. [2019-08-05 10:10:15,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:10:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 23546 states and 32116 transitions. [2019-08-05 10:10:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:10:15,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:15,147 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:15,147 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1330469809, now seen corresponding path program 1 times [2019-08-05 10:10:15,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:15,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:10:15,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 10:10:15,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:15,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:15,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:15,485 INFO L87 Difference]: Start difference. First operand 23546 states and 32116 transitions. Second operand 5 states. [2019-08-05 10:10:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:15,848 INFO L93 Difference]: Finished difference Result 24324 states and 33161 transitions. [2019-08-05 10:10:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:15,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-08-05 10:10:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:15,871 INFO L225 Difference]: With dead ends: 24324 [2019-08-05 10:10:15,871 INFO L226 Difference]: Without dead ends: 24317 [2019-08-05 10:10:15,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-08-05 10:10:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 24035. [2019-08-05 10:10:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-08-05 10:10:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 32686 transitions. [2019-08-05 10:10:16,081 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 32686 transitions. Word has length 143 [2019-08-05 10:10:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:16,082 INFO L475 AbstractCegarLoop]: Abstraction has 24035 states and 32686 transitions. [2019-08-05 10:10:16,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 32686 transitions. [2019-08-05 10:10:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:10:16,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:16,087 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:16,088 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:10:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:16,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:16,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:10:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:16,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:16,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:16,197 INFO L87 Difference]: Start difference. First operand 24035 states and 32686 transitions. Second operand 3 states. [2019-08-05 10:10:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:16,506 INFO L93 Difference]: Finished difference Result 28005 states and 37776 transitions. [2019-08-05 10:10:16,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:16,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:10:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:16,548 INFO L225 Difference]: With dead ends: 28005 [2019-08-05 10:10:16,548 INFO L226 Difference]: Without dead ends: 27932 [2019-08-05 10:10:16,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-08-05 10:10:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 27882. [2019-08-05 10:10:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27882 states. [2019-08-05 10:10:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27882 states to 27882 states and 37631 transitions. [2019-08-05 10:10:17,015 INFO L78 Accepts]: Start accepts. Automaton has 27882 states and 37631 transitions. Word has length 171 [2019-08-05 10:10:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,016 INFO L475 AbstractCegarLoop]: Abstraction has 27882 states and 37631 transitions. [2019-08-05 10:10:17,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 27882 states and 37631 transitions. [2019-08-05 10:10:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:10:17,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,020 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:17,020 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:10:17,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:17,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:10:17,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:17,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:17,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:17,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:17,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:17,131 INFO L87 Difference]: Start difference. First operand 27882 states and 37631 transitions. Second operand 3 states. [2019-08-05 10:10:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:17,362 INFO L93 Difference]: Finished difference Result 31872 states and 42931 transitions. [2019-08-05 10:10:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:17,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:10:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:17,397 INFO L225 Difference]: With dead ends: 31872 [2019-08-05 10:10:17,397 INFO L226 Difference]: Without dead ends: 31824 [2019-08-05 10:10:17,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31824 states. [2019-08-05 10:10:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31824 to 29962. [2019-08-05 10:10:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29962 states. [2019-08-05 10:10:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29962 states to 29962 states and 40395 transitions. [2019-08-05 10:10:17,651 INFO L78 Accepts]: Start accepts. Automaton has 29962 states and 40395 transitions. Word has length 173 [2019-08-05 10:10:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,651 INFO L475 AbstractCegarLoop]: Abstraction has 29962 states and 40395 transitions. [2019-08-05 10:10:17,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29962 states and 40395 transitions. [2019-08-05 10:10:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:10:17,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,656 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:17,657 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:10:17,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:10:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:17,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:17,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,538 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 5 [2019-08-05 10:10:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 10:10:18,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:18,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:10:18,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:18,961 INFO L87 Difference]: Start difference. First operand 29962 states and 40395 transitions. Second operand 8 states. [2019-08-05 10:10:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:20,218 INFO L93 Difference]: Finished difference Result 34159 states and 45568 transitions. [2019-08-05 10:10:20,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:10:20,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:10:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:20,250 INFO L225 Difference]: With dead ends: 34159 [2019-08-05 10:10:20,250 INFO L226 Difference]: Without dead ends: 34159 [2019-08-05 10:10:20,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:10:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2019-08-05 10:10:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 33905. [2019-08-05 10:10:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33905 states. [2019-08-05 10:10:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 45314 transitions. [2019-08-05 10:10:20,494 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 45314 transitions. Word has length 174 [2019-08-05 10:10:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:20,494 INFO L475 AbstractCegarLoop]: Abstraction has 33905 states and 45314 transitions. [2019-08-05 10:10:20,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 45314 transitions. [2019-08-05 10:10:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:10:20,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:20,499 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:20,499 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash 570429234, now seen corresponding path program 1 times [2019-08-05 10:10:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:20,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:10:20,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 194 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:10:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:20,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:10:20,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:20,821 INFO L87 Difference]: Start difference. First operand 33905 states and 45314 transitions. Second operand 8 states. [2019-08-05 10:10:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:21,381 INFO L93 Difference]: Finished difference Result 63378 states and 85380 transitions. [2019-08-05 10:10:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:10:21,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-08-05 10:10:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:21,452 INFO L225 Difference]: With dead ends: 63378 [2019-08-05 10:10:21,452 INFO L226 Difference]: Without dead ends: 63288 [2019-08-05 10:10:21,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:10:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63288 states. [2019-08-05 10:10:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63288 to 47156. [2019-08-05 10:10:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47156 states. [2019-08-05 10:10:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 64161 transitions. [2019-08-05 10:10:22,097 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 64161 transitions. Word has length 175 [2019-08-05 10:10:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:22,097 INFO L475 AbstractCegarLoop]: Abstraction has 47156 states and 64161 transitions. [2019-08-05 10:10:22,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 64161 transitions. [2019-08-05 10:10:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:10:22,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:22,102 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:22,103 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:10:22,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:22,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:10:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:22,318 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:10:22,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,485 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 11 [2019-08-05 10:10:22,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,256 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:23,514 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:23,759 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:24,014 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:24,232 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:24,435 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:24,660 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:24,868 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:25,023 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:25,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:25,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:25,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:25,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:25,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:10:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:25,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:10:25,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:10:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:10:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:10:25,240 INFO L87 Difference]: Start difference. First operand 47156 states and 64161 transitions. Second operand 23 states. [2019-08-05 10:10:25,914 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2019-08-05 10:10:26,127 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-08-05 10:10:26,706 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-08-05 10:10:27,758 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:28,136 INFO L93 Difference]: Finished difference Result 58363 states and 78277 transitions. [2019-08-05 10:10:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:10:28,137 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 177 [2019-08-05 10:10:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:28,193 INFO L225 Difference]: With dead ends: 58363 [2019-08-05 10:10:28,193 INFO L226 Difference]: Without dead ends: 58363 [2019-08-05 10:10:28,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:10:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58363 states. [2019-08-05 10:10:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58363 to 54535. [2019-08-05 10:10:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54535 states. [2019-08-05 10:10:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54535 states to 54535 states and 73601 transitions. [2019-08-05 10:10:28,645 INFO L78 Accepts]: Start accepts. Automaton has 54535 states and 73601 transitions. Word has length 177 [2019-08-05 10:10:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:28,645 INFO L475 AbstractCegarLoop]: Abstraction has 54535 states and 73601 transitions. [2019-08-05 10:10:28,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:10:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 54535 states and 73601 transitions. [2019-08-05 10:10:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:10:28,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:28,650 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:28,651 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1753462791, now seen corresponding path program 1 times [2019-08-05 10:10:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:28,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:10:28,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:28,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:29,722 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:31,073 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:31,330 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:31,564 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:31,824 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:32,065 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:32,249 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:32,417 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:32,562 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:32,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:10:32,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:10:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:10:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:10:32,735 INFO L87 Difference]: Start difference. First operand 54535 states and 73601 transitions. Second operand 22 states. [2019-08-05 10:10:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:35,098 INFO L93 Difference]: Finished difference Result 57305 states and 76887 transitions. [2019-08-05 10:10:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:10:35,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-08-05 10:10:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:35,157 INFO L225 Difference]: With dead ends: 57305 [2019-08-05 10:10:35,158 INFO L226 Difference]: Without dead ends: 57305 [2019-08-05 10:10:35,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:10:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2019-08-05 10:10:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 55550. [2019-08-05 10:10:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55550 states. [2019-08-05 10:10:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55550 states to 55550 states and 74818 transitions. [2019-08-05 10:10:35,849 INFO L78 Accepts]: Start accepts. Automaton has 55550 states and 74818 transitions. Word has length 178 [2019-08-05 10:10:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:35,850 INFO L475 AbstractCegarLoop]: Abstraction has 55550 states and 74818 transitions. [2019-08-05 10:10:35,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:10:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 55550 states and 74818 transitions. [2019-08-05 10:10:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:10:35,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:35,858 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:35,858 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash -275131603, now seen corresponding path program 1 times [2019-08-05 10:10:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:35,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:35,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:10:35,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:35,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:35,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:35,972 INFO L87 Difference]: Start difference. First operand 55550 states and 74818 transitions. Second operand 3 states. [2019-08-05 10:10:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:36,313 INFO L93 Difference]: Finished difference Result 54534 states and 70764 transitions. [2019-08-05 10:10:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:36,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-08-05 10:10:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:36,368 INFO L225 Difference]: With dead ends: 54534 [2019-08-05 10:10:36,369 INFO L226 Difference]: Without dead ends: 54414 [2019-08-05 10:10:36,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54414 states. [2019-08-05 10:10:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54414 to 47565. [2019-08-05 10:10:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47565 states. [2019-08-05 10:10:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47565 states to 47565 states and 62175 transitions. [2019-08-05 10:10:36,792 INFO L78 Accepts]: Start accepts. Automaton has 47565 states and 62175 transitions. Word has length 194 [2019-08-05 10:10:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:36,792 INFO L475 AbstractCegarLoop]: Abstraction has 47565 states and 62175 transitions. [2019-08-05 10:10:36,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47565 states and 62175 transitions. [2019-08-05 10:10:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:10:36,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:36,798 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:36,798 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1621474027, now seen corresponding path program 1 times [2019-08-05 10:10:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:36,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:10:36,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 142 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:10:37,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:37,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:10:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:10:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:37,249 INFO L87 Difference]: Start difference. First operand 47565 states and 62175 transitions. Second operand 6 states. [2019-08-05 10:10:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:38,377 INFO L93 Difference]: Finished difference Result 66827 states and 88079 transitions. [2019-08-05 10:10:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:38,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-08-05 10:10:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:38,444 INFO L225 Difference]: With dead ends: 66827 [2019-08-05 10:10:38,444 INFO L226 Difference]: Without dead ends: 66827 [2019-08-05 10:10:38,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-08-05 10:10:39,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 44927. [2019-08-05 10:10:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44927 states. [2019-08-05 10:10:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44927 states to 44927 states and 59012 transitions. [2019-08-05 10:10:39,093 INFO L78 Accepts]: Start accepts. Automaton has 44927 states and 59012 transitions. Word has length 195 [2019-08-05 10:10:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:39,094 INFO L475 AbstractCegarLoop]: Abstraction has 44927 states and 59012 transitions. [2019-08-05 10:10:39,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 44927 states and 59012 transitions. [2019-08-05 10:10:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:10:39,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:39,101 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:39,102 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1319648849, now seen corresponding path program 1 times [2019-08-05 10:10:39,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:39,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:10:39,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 128 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 10:10:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:39,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:10:39,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:39,352 INFO L87 Difference]: Start difference. First operand 44927 states and 59012 transitions. Second operand 8 states. [2019-08-05 10:10:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:39,927 INFO L93 Difference]: Finished difference Result 75763 states and 98574 transitions. [2019-08-05 10:10:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:10:39,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-08-05 10:10:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:40,014 INFO L225 Difference]: With dead ends: 75763 [2019-08-05 10:10:40,015 INFO L226 Difference]: Without dead ends: 75625 [2019-08-05 10:10:40,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:10:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75625 states. [2019-08-05 10:10:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75625 to 68588. [2019-08-05 10:10:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68588 states. [2019-08-05 10:10:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68588 states to 68588 states and 89202 transitions. [2019-08-05 10:10:40,642 INFO L78 Accepts]: Start accepts. Automaton has 68588 states and 89202 transitions. Word has length 196 [2019-08-05 10:10:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:40,643 INFO L475 AbstractCegarLoop]: Abstraction has 68588 states and 89202 transitions. [2019-08-05 10:10:40,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 68588 states and 89202 transitions. [2019-08-05 10:10:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:10:40,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:40,648 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:40,649 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:10:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:40,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:40,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-08-05 10:10:40,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:40,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:40,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:40,768 INFO L87 Difference]: Start difference. First operand 68588 states and 89202 transitions. Second operand 3 states. [2019-08-05 10:10:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:41,016 INFO L93 Difference]: Finished difference Result 88546 states and 114684 transitions. [2019-08-05 10:10:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:41,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:10:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:41,123 INFO L225 Difference]: With dead ends: 88546 [2019-08-05 10:10:41,123 INFO L226 Difference]: Without dead ends: 87546 [2019-08-05 10:10:41,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87546 states. [2019-08-05 10:10:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87546 to 87544. [2019-08-05 10:10:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87544 states. [2019-08-05 10:10:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87544 states to 87544 states and 113300 transitions. [2019-08-05 10:10:42,185 INFO L78 Accepts]: Start accepts. Automaton has 87544 states and 113300 transitions. Word has length 200 [2019-08-05 10:10:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:42,186 INFO L475 AbstractCegarLoop]: Abstraction has 87544 states and 113300 transitions. [2019-08-05 10:10:42,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 87544 states and 113300 transitions. [2019-08-05 10:10:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:10:42,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:42,190 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:42,190 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:10:42,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:42,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:10:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:42,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,657 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:10:42,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,196 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:43,463 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:43,738 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:43,967 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:44,181 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:44,379 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:44,551 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:44,721 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:44,865 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:44,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:44,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:44,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:44,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:44,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 20 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:45,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:45,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:10:45,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:10:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:10:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:10:45,466 INFO L87 Difference]: Start difference. First operand 87544 states and 113300 transitions. Second operand 30 states. [2019-08-05 10:10:47,242 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-05 10:10:50,619 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:51,769 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:52,077 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:10:52,270 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:52,414 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 10:10:53,979 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:10:54,832 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:55,092 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:10:55,284 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-08-05 10:10:55,440 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:55,708 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:10:56,096 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-08-05 10:10:56,547 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:10:56,724 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:59,366 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:10:59,632 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-08-05 10:11:02,004 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:11:02,318 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-08-05 10:11:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:03,666 INFO L93 Difference]: Finished difference Result 560683 states and 758394 transitions. [2019-08-05 10:11:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:11:03,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-08-05 10:11:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:04,445 INFO L225 Difference]: With dead ends: 560683 [2019-08-05 10:11:04,445 INFO L226 Difference]: Without dead ends: 556251 [2019-08-05 10:11:04,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2667, Invalid=7839, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:11:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556251 states. [2019-08-05 10:11:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556251 to 413384. [2019-08-05 10:11:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413384 states. [2019-08-05 10:11:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413384 states to 413384 states and 572682 transitions. [2019-08-05 10:11:14,786 INFO L78 Accepts]: Start accepts. Automaton has 413384 states and 572682 transitions. Word has length 203 [2019-08-05 10:11:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:14,786 INFO L475 AbstractCegarLoop]: Abstraction has 413384 states and 572682 transitions. [2019-08-05 10:11:14,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:11:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 413384 states and 572682 transitions. [2019-08-05 10:11:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:11:14,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:14,790 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:14,790 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1638698119, now seen corresponding path program 1 times [2019-08-05 10:11:14,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:14,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:11:14,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:14,983 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:11:14,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:14,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:15,618 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:11:16,010 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:11:16,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 31 proven. 378 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:11:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:16,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:11:16,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:11:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:11:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:11:16,889 INFO L87 Difference]: Start difference. First operand 413384 states and 572682 transitions. Second operand 16 states. [2019-08-05 10:11:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:26,345 INFO L93 Difference]: Finished difference Result 414860 states and 574279 transitions. [2019-08-05 10:11:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:11:26,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 204 [2019-08-05 10:11:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:27,097 INFO L225 Difference]: With dead ends: 414860 [2019-08-05 10:11:27,098 INFO L226 Difference]: Without dead ends: 414860 [2019-08-05 10:11:27,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414860 states. [2019-08-05 10:11:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414860 to 413581. [2019-08-05 10:11:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413581 states. [2019-08-05 10:11:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413581 states to 413581 states and 572902 transitions. [2019-08-05 10:11:33,091 INFO L78 Accepts]: Start accepts. Automaton has 413581 states and 572902 transitions. Word has length 204 [2019-08-05 10:11:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:33,092 INFO L475 AbstractCegarLoop]: Abstraction has 413581 states and 572902 transitions. [2019-08-05 10:11:33,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:11:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 413581 states and 572902 transitions. [2019-08-05 10:11:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:11:33,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:33,097 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:33,097 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -733642234, now seen corresponding path program 1 times [2019-08-05 10:11:33,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:33,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:11:33,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:33,297 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:11:33,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,867 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:11:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 10:11:34,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:34,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:11:34,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:11:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:11:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:11:34,550 INFO L87 Difference]: Start difference. First operand 413581 states and 572902 transitions. Second operand 19 states. [2019-08-05 10:11:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:44,176 INFO L93 Difference]: Finished difference Result 715237 states and 971408 transitions. [2019-08-05 10:11:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:11:44,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2019-08-05 10:11:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:45,251 INFO L225 Difference]: With dead ends: 715237 [2019-08-05 10:11:45,252 INFO L226 Difference]: Without dead ends: 709845 [2019-08-05 10:11:45,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709845 states. [2019-08-05 10:11:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709845 to 617880. [2019-08-05 10:11:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617880 states. [2019-08-05 10:12:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617880 states to 617880 states and 851738 transitions. [2019-08-05 10:12:06,570 INFO L78 Accepts]: Start accepts. Automaton has 617880 states and 851738 transitions. Word has length 204 [2019-08-05 10:12:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:06,570 INFO L475 AbstractCegarLoop]: Abstraction has 617880 states and 851738 transitions. [2019-08-05 10:12:06,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:12:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 617880 states and 851738 transitions. [2019-08-05 10:12:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:12:06,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:06,575 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:06,575 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -402574455, now seen corresponding path program 1 times [2019-08-05 10:12:06,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:06,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:06,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-08-05 10:12:06,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:06,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:06,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:06,700 INFO L87 Difference]: Start difference. First operand 617880 states and 851738 transitions. Second operand 3 states. [2019-08-05 10:12:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:08,131 INFO L93 Difference]: Finished difference Result 614256 states and 831608 transitions. [2019-08-05 10:12:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:08,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-08-05 10:12:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:09,169 INFO L225 Difference]: With dead ends: 614256 [2019-08-05 10:12:09,170 INFO L226 Difference]: Without dead ends: 600340 [2019-08-05 10:12:09,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600340 states. [2019-08-05 10:12:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600340 to 576854. [2019-08-05 10:12:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576854 states. [2019-08-05 10:12:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576854 states to 576854 states and 782792 transitions. [2019-08-05 10:12:28,591 INFO L78 Accepts]: Start accepts. Automaton has 576854 states and 782792 transitions. Word has length 206 [2019-08-05 10:12:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:28,591 INFO L475 AbstractCegarLoop]: Abstraction has 576854 states and 782792 transitions. [2019-08-05 10:12:28,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 576854 states and 782792 transitions. [2019-08-05 10:12:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:12:28,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:28,595 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:28,595 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash -947645514, now seen corresponding path program 1 times [2019-08-05 10:12:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:28,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:12:28,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:28,794 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:12:28,942 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:12:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 191 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-08-05 10:12:29,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:29,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:12:29,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:29,147 INFO L87 Difference]: Start difference. First operand 576854 states and 782792 transitions. Second operand 6 states. [2019-08-05 10:12:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,820 INFO L93 Difference]: Finished difference Result 573497 states and 778805 transitions. [2019-08-05 10:12:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:37,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-08-05 10:12:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,751 INFO L225 Difference]: With dead ends: 573497 [2019-08-05 10:12:38,751 INFO L226 Difference]: Without dead ends: 573137 [2019-08-05 10:12:38,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573137 states. [2019-08-05 10:12:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573137 to 573110. [2019-08-05 10:12:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573110 states. [2019-08-05 10:12:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573110 states to 573110 states and 778415 transitions. [2019-08-05 10:12:57,724 INFO L78 Accepts]: Start accepts. Automaton has 573110 states and 778415 transitions. Word has length 208 [2019-08-05 10:12:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,724 INFO L475 AbstractCegarLoop]: Abstraction has 573110 states and 778415 transitions. [2019-08-05 10:12:57,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 573110 states and 778415 transitions. [2019-08-05 10:12:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:12:57,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,729 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:57,729 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1925586360, now seen corresponding path program 1 times [2019-08-05 10:12:57,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,676 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:12:58,944 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 Received shutdown request... [2019-08-05 10:12:59,130 WARN L196 SmtUtils]: Removed 13 from assertion stack [2019-08-05 10:12:59,131 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:12:59,131 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:12:59,135 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:12:59,136 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_762_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:12:59 BoogieIcfgContainer [2019-08-05 10:12:59,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:12:59,138 INFO L168 Benchmark]: Toolchain (without parser) took 192779.50 ms. Allocated memory was 132.6 MB in the beginning and 4.7 GB in the end (delta: 4.6 GB). Free memory was 106.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,138 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 132.6 MB. Free memory was 106.6 MB in the beginning and 104.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,139 INFO L168 Benchmark]: Boogie Preprocessor took 131.38 ms. Allocated memory is still 132.6 MB. Free memory was 104.3 MB in the beginning and 100.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,140 INFO L168 Benchmark]: RCFGBuilder took 4326.02 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 136.8 MB in the end (delta: -36.3 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,141 INFO L168 Benchmark]: TraceAbstraction took 188249.76 ms. Allocated memory was 195.6 MB in the beginning and 4.7 GB in the end (delta: 4.6 GB). Free memory was 136.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-08-05 10:12:59,143 INFO L335 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 132.6 MB. Free memory was 106.6 MB in the beginning and 104.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.38 ms. Allocated memory is still 132.6 MB. Free memory was 104.3 MB in the beginning and 100.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4326.02 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 136.8 MB in the end (delta: -36.3 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188249.76 ms. Allocated memory was 195.6 MB in the beginning and 4.7 GB in the end (delta: 4.6 GB). Free memory was 136.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 469]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 469). Cancelled while BasicCegarLoop was analyzing trace of length 218 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 65 for 171ms.. - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 706). Cancelled while BasicCegarLoop was analyzing trace of length 218 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 65 for 171ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. TIMEOUT Result, 188.1s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 72.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6545 SDtfs, 16871 SDslu, 21594 SDs, 0 SdLazy, 10346 SolverSat, 1834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4569 GetRequests, 4177 SyntacticMatches, 31 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5396 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617880occurred in iteration=34, 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: 84.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 321537 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 4434 NumberOfCodeBlocks, 4434 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4398 ConstructedInterpolants, 0 QuantifiedInterpolants, 4285888 SizeOfPredicates, 154 NumberOfNonLiveVariables, 12756 ConjunctsInSsa, 382 ConjunctsInUnsatCore, 36 InterpolantComputations, 19 PerfectInterpolantSequences, 4207/7044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown