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/recursive/regression/bpl/CTL/encT_TRE_with_Boogie_Specs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:33,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:33,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:33,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:33,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:33,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:33,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:33,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:33,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:33,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:33,119 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:33,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:33,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:33,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:33,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:33,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:33,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:33,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:33,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:33,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:33,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:33,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:33,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:33,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:33,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:33,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:33,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:33,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:33,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:33,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:33,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:33,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:33,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:33,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:07:33,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:07:33,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:07:33,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:07:33,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:07:33,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:07:33,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:07:33,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:07:33,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:07:33,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:07:33,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:07:33,227 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:07:33,228 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:07:33,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/CTL/encT_TRE_with_Boogie_Specs.bpl [2019-08-05 11:07:33,229 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/CTL/encT_TRE_with_Boogie_Specs.bpl' [2019-08-05 11:07:33,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:07:33,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:07:33,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:33,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:07:33,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:07:33,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,321 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:07:33,321 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:07:33,322 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:07:33,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:33,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:07:33,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:07:33,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:07:33,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/1) ... [2019-08-05 11:07:33,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:07:33,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:07:33,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:07:33,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:07:33,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (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 11:07:33,514 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encLT given in one single declaration [2019-08-05 11:07:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure encLT [2019-08-05 11:07:33,515 INFO L138 BoogieDeclarations]: Found implementation of procedure encLT [2019-08-05 11:07:33,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encRLT given in one single declaration [2019-08-05 11:07:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure encRLT [2019-08-05 11:07:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure encRLT [2019-08-05 11:07:33,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encT given in one single declaration [2019-08-05 11:07:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure encT [2019-08-05 11:07:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure encT [2019-08-05 11:07:33,517 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Test given in one single declaration [2019-08-05 11:07:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure Test [2019-08-05 11:07:33,517 INFO L138 BoogieDeclarations]: Found implementation of procedure Test [2019-08-05 11:07:33,517 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encLLT given in one single declaration [2019-08-05 11:07:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure encLLT [2019-08-05 11:07:33,518 INFO L138 BoogieDeclarations]: Found implementation of procedure encLLT [2019-08-05 11:07:35,778 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:07:35,778 INFO L283 CfgBuilder]: Removed 80 assume(true) statements. [2019-08-05 11:07:35,781 INFO L202 PluginConnector]: Adding new model encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:35 BoogieIcfgContainer [2019-08-05 11:07:35,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:07:35,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:07:35,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:07:35,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:07:35,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:33" (1/2) ... [2019-08-05 11:07:35,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8ce317 and model type encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:07:35, skipping insertion in model container [2019-08-05 11:07:35,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:35" (2/2) ... [2019-08-05 11:07:35,791 INFO L109 eAbstractionObserver]: Analyzing ICFG encT_TRE_with_Boogie_Specs.bpl [2019-08-05 11:07:35,802 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:07:35,810 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-08-05 11:07:35,829 INFO L252 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-08-05 11:07:35,858 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:07:35,859 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:07:35,859 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:07:35,859 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:07:35,859 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:07:35,859 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:07:35,860 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:07:35,861 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:07:35,861 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:07:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-08-05 11:07:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:35,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:35,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:35,899 INFO L418 AbstractCegarLoop]: === Iteration 1 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:35,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 16586, now seen corresponding path program 1 times [2019-08-05 11:07:35,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:35,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:35,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:36,234 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:07:36,236 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 11:07:36,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:36,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:36,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:36,264 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-08-05 11:07:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:36,316 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2019-08-05 11:07:36,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:36,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:36,333 INFO L225 Difference]: With dead ends: 140 [2019-08-05 11:07:36,334 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:07:36,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:07:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 11:07:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:07:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2019-08-05 11:07:36,390 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 2 [2019-08-05 11:07:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:36,390 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2019-08-05 11:07:36,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2019-08-05 11:07:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:36,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:36,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:36,393 INFO L418 AbstractCegarLoop]: === Iteration 2 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 17367, now seen corresponding path program 1 times [2019-08-05 11:07:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:36,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:36,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:36,505 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 11:07:36,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:36,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:36,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:36,514 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand 3 states. [2019-08-05 11:07:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:36,541 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2019-08-05 11:07:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:36,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:36,544 INFO L225 Difference]: With dead ends: 132 [2019-08-05 11:07:36,544 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:07:36,545 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 11:07:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:07:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 11:07:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:07:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2019-08-05 11:07:36,557 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 2 [2019-08-05 11:07:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:36,558 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2019-08-05 11:07:36,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2019-08-05 11:07:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:36,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:36,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:36,565 INFO L418 AbstractCegarLoop]: === Iteration 3 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 16695, now seen corresponding path program 1 times [2019-08-05 11:07:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:36,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:36,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:36,603 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 11:07:36,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:36,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:36,606 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand 3 states. [2019-08-05 11:07:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:36,614 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2019-08-05 11:07:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:36,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:36,616 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:07:36,617 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:07:36,617 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 11:07:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:07:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:07:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:07:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2019-08-05 11:07:36,627 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 2 [2019-08-05 11:07:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:36,628 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2019-08-05 11:07:36,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2019-08-05 11:07:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:36,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:36,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:36,630 INFO L418 AbstractCegarLoop]: === Iteration 4 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 281830, now seen corresponding path program 1 times [2019-08-05 11:07:36,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:36,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:36,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:36,918 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2019-08-05 11:07:36,919 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 11:07:36,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:36,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:36,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:36,921 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand 4 states. [2019-08-05 11:07:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,205 INFO L93 Difference]: Finished difference Result 149 states and 193 transitions. [2019-08-05 11:07:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:37,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:07:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,209 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:07:37,209 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:07:37,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:07:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-08-05 11:07:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:07:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2019-08-05 11:07:37,222 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 3 [2019-08-05 11:07:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,222 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2019-08-05 11:07:37,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2019-08-05 11:07:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:37,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:37,225 INFO L418 AbstractCegarLoop]: === Iteration 5 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 77389, now seen corresponding path program 1 times [2019-08-05 11:07:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,342 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 11:07:37,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,343 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand 3 states. [2019-08-05 11:07:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,408 INFO L93 Difference]: Finished difference Result 131 states and 176 transitions. [2019-08-05 11:07:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:07:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,409 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:07:37,409 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:07:37,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:07:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-08-05 11:07:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:07:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2019-08-05 11:07:37,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 3 [2019-08-05 11:07:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,422 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2019-08-05 11:07:37,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2019-08-05 11:07:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:07:37,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:07:37,425 INFO L418 AbstractCegarLoop]: === Iteration 6 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,426 INFO L82 PathProgramCache]: Analyzing trace with hash 16706230, now seen corresponding path program 1 times [2019-08-05 11:07:37,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,494 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 11:07:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,497 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 3 states. [2019-08-05 11:07:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,501 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2019-08-05 11:07:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:07:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,509 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:07:37,509 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:07:37,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:07:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-08-05 11:07:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:07:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2019-08-05 11:07:37,516 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 4 [2019-08-05 11:07:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,517 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2019-08-05 11:07:37,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2019-08-05 11:07:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:07:37,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:07:37,521 INFO L418 AbstractCegarLoop]: === Iteration 7 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash 16691013, now seen corresponding path program 1 times [2019-08-05 11:07:37,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,565 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 11:07:37,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,566 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand 3 states. [2019-08-05 11:07:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,573 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2019-08-05 11:07:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:07:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,575 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:07:37,575 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:07:37,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:07:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:07:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:07:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2019-08-05 11:07:37,603 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 4 [2019-08-05 11:07:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,603 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2019-08-05 11:07:37,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2019-08-05 11:07:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:37,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:37,608 INFO L418 AbstractCegarLoop]: === Iteration 8 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash 270847955, now seen corresponding path program 1 times [2019-08-05 11:07:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,637 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 11:07:37,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,638 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand 3 states. [2019-08-05 11:07:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,827 INFO L93 Difference]: Finished difference Result 157 states and 215 transitions. [2019-08-05 11:07:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:07:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,830 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:07:37,830 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:07:37,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:07:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:07:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2019-08-05 11:07:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:07:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2019-08-05 11:07:37,836 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 5 [2019-08-05 11:07:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,836 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2019-08-05 11:07:37,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2019-08-05 11:07:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:37,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:37,839 INFO L418 AbstractCegarLoop]: === Iteration 9 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash 517893185, now seen corresponding path program 1 times [2019-08-05 11:07:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:38,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:38,105 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 11:07:38,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:38,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:38,107 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 6 states. [2019-08-05 11:07:38,364 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-08-05 11:07:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,452 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2019-08-05 11:07:38,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:38,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:07:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,453 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:07:38,453 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:07:38,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:07:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:07:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:07:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2019-08-05 11:07:38,457 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 5 [2019-08-05 11:07:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,458 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2019-08-05 11:07:38,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2019-08-05 11:07:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:38,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:38,460 INFO L418 AbstractCegarLoop]: === Iteration 10 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash 270856074, now seen corresponding path program 1 times [2019-08-05 11:07:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,531 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 11:07:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:38,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:38,534 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 5 states. [2019-08-05 11:07:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,643 INFO L93 Difference]: Finished difference Result 191 states and 258 transitions. [2019-08-05 11:07:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:38,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:07:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,645 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:07:38,645 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:07:38,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:07:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 128. [2019-08-05 11:07:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:07:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2019-08-05 11:07:38,653 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 5 [2019-08-05 11:07:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,654 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2019-08-05 11:07:38,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2019-08-05 11:07:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:38,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:38,656 INFO L418 AbstractCegarLoop]: === Iteration 11 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 74373338, now seen corresponding path program 1 times [2019-08-05 11:07:38,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,697 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 11:07:38,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:38,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:38,698 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand 3 states. [2019-08-05 11:07:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,771 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2019-08-05 11:07:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:38,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:07:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,773 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:07:38,773 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:07:38,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:07:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:07:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2019-08-05 11:07:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:07:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2019-08-05 11:07:38,778 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 5 [2019-08-05 11:07:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,778 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2019-08-05 11:07:38,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2019-08-05 11:07:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:38,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:38,780 INFO L418 AbstractCegarLoop]: === Iteration 12 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash 74388494, now seen corresponding path program 1 times [2019-08-05 11:07:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,829 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 11:07:38,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:38,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:38,831 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand 3 states. [2019-08-05 11:07:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,873 INFO L93 Difference]: Finished difference Result 163 states and 226 transitions. [2019-08-05 11:07:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:38,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:07:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,875 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:07:38,876 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:07:38,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:07:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:07:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 128. [2019-08-05 11:07:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:07:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2019-08-05 11:07:38,880 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 5 [2019-08-05 11:07:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,881 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2019-08-05 11:07:38,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2019-08-05 11:07:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:07:38,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:07:38,883 INFO L418 AbstractCegarLoop]: === Iteration 13 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -193395994, now seen corresponding path program 1 times [2019-08-05 11:07:38,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,959 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 11:07:38,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:38,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:38,961 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand 6 states. [2019-08-05 11:07:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,428 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2019-08-05 11:07:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:39,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:07:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,431 INFO L225 Difference]: With dead ends: 198 [2019-08-05 11:07:39,431 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:07:39,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:07:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:07:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 121. [2019-08-05 11:07:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:07:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2019-08-05 11:07:39,436 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 6 [2019-08-05 11:07:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,436 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2019-08-05 11:07:39,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2019-08-05 11:07:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:07:39,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:07:39,438 INFO L418 AbstractCegarLoop]: === Iteration 14 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1988923891, now seen corresponding path program 1 times [2019-08-05 11:07:39,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:39,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:39,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:39,621 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 11:07:39,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:39,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:39,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:39,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:39,623 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand 6 states. [2019-08-05 11:07:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,966 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2019-08-05 11:07:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:39,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:07:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,969 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:07:39,969 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:07:39,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:07:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2019-08-05 11:07:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:07:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2019-08-05 11:07:39,973 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 6 [2019-08-05 11:07:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,974 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2019-08-05 11:07:39,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2019-08-05 11:07:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:39,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:39,975 INFO L418 AbstractCegarLoop]: === Iteration 15 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1708110283, now seen corresponding path program 1 times [2019-08-05 11:07:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,020 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 11:07:40,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,022 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand 4 states. [2019-08-05 11:07:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,218 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2019-08-05 11:07:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,219 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:07:40,220 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:07:40,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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 11:07:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:07:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2019-08-05 11:07:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:07:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2019-08-05 11:07:40,230 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 7 [2019-08-05 11:07:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,230 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2019-08-05 11:07:40,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2019-08-05 11:07:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:40,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,232 INFO L418 AbstractCegarLoop]: === Iteration 16 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1541663024, now seen corresponding path program 1 times [2019-08-05 11:07:40,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,367 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 11:07:40,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,370 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand 4 states. [2019-08-05 11:07:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,495 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-08-05 11:07:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,498 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:07:40,498 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:07:40,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:07:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2019-08-05 11:07:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:07:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2019-08-05 11:07:40,502 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 7 [2019-08-05 11:07:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,502 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2019-08-05 11:07:40,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2019-08-05 11:07:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,504 INFO L418 AbstractCegarLoop]: === Iteration 17 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash -546917769, now seen corresponding path program 1 times [2019-08-05 11:07:40,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,543 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 11:07:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,545 INFO L87 Difference]: Start difference. First operand 133 states and 176 transitions. Second operand 3 states. [2019-08-05 11:07:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,558 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-08-05 11:07:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:40,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:07:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,560 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:07:40,560 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:07:40,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:07:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:07:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 11:07:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:07:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2019-08-05 11:07:40,565 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 8 [2019-08-05 11:07:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,565 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2019-08-05 11:07:40,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2019-08-05 11:07:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,566 INFO L418 AbstractCegarLoop]: === Iteration 18 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1411814657, now seen corresponding path program 1 times [2019-08-05 11:07:40,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,599 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 11:07:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,600 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand 3 states. [2019-08-05 11:07:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,618 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2019-08-05 11:07:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:40,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:07:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,620 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:07:40,620 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:07:40,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:07:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:07:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 11:07:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:07:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2019-08-05 11:07:40,625 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 8 [2019-08-05 11:07:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,625 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2019-08-05 11:07:40,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2019-08-05 11:07:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,627 INFO L418 AbstractCegarLoop]: === Iteration 19 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1169946488, now seen corresponding path program 1 times [2019-08-05 11:07:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:40,719 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 11:07:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:40,721 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 6 states. [2019-08-05 11:07:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,855 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2019-08-05 11:07:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:40,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:07:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,857 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:07:40,858 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:07:40,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:07:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2019-08-05 11:07:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:07:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2019-08-05 11:07:40,864 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 8 [2019-08-05 11:07:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,864 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2019-08-05 11:07:40,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2019-08-05 11:07:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,866 INFO L418 AbstractCegarLoop]: === Iteration 20 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash -95409341, now seen corresponding path program 1 times [2019-08-05 11:07:40,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:40,978 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 11:07:40,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:40,980 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 6 states. [2019-08-05 11:07:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,117 INFO L93 Difference]: Finished difference Result 160 states and 203 transitions. [2019-08-05 11:07:41,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:41,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:07:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,119 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:07:41,120 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:07:41,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:07:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2019-08-05 11:07:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:07:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2019-08-05 11:07:41,124 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 8 [2019-08-05 11:07:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,124 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2019-08-05 11:07:41,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2019-08-05 11:07:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:41,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,125 INFO L418 AbstractCegarLoop]: === Iteration 21 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -816580904, now seen corresponding path program 1 times [2019-08-05 11:07:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,166 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 11:07:41,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:41,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:41,167 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand 4 states. [2019-08-05 11:07:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,230 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2019-08-05 11:07:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:41,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:07:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,231 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:07:41,231 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:07:41,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 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 11:07:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:07:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 11:07:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:07:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2019-08-05 11:07:41,236 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 9 [2019-08-05 11:07:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,236 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2019-08-05 11:07:41,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2019-08-05 11:07:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:41,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,237 INFO L418 AbstractCegarLoop]: === Iteration 22 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1908602257, now seen corresponding path program 1 times [2019-08-05 11:07:41,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,304 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 11:07:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:41,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:41,306 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand 4 states. [2019-08-05 11:07:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,313 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2019-08-05 11:07:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:41,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:07:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,317 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:07:41,317 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:07:41,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:07:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-08-05 11:07:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:07:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-08-05 11:07:41,320 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 9 [2019-08-05 11:07:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,320 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-08-05 11:07:41,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-08-05 11:07:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:07:41,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,323 INFO L418 AbstractCegarLoop]: === Iteration 23 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 485369817, now seen corresponding path program 1 times [2019-08-05 11:07:41,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:41,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:41,747 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-08-05 11:07:41,755 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 11:07:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:41,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:41,757 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 6 states. [2019-08-05 11:07:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,889 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2019-08-05 11:07:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:41,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 11:07:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,892 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:07:41,892 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:07:41,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:07:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 165. [2019-08-05 11:07:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:07:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2019-08-05 11:07:41,898 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 13 [2019-08-05 11:07:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,898 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2019-08-05 11:07:41,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2019-08-05 11:07:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:07:41,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,899 INFO L418 AbstractCegarLoop]: === Iteration 24 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1513926351, now seen corresponding path program 1 times [2019-08-05 11:07:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:41,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:41,973 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 11:07:41,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:41,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:41,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:41,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:41,975 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 6 states. [2019-08-05 11:07:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:42,542 INFO L93 Difference]: Finished difference Result 250 states and 314 transitions. [2019-08-05 11:07:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:42,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 11:07:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:42,544 INFO L225 Difference]: With dead ends: 250 [2019-08-05 11:07:42,544 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:07:42,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:07:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2019-08-05 11:07:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 11:07:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2019-08-05 11:07:42,548 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 13 [2019-08-05 11:07:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:42,548 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2019-08-05 11:07:42,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2019-08-05 11:07:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:07:42,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:42,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:42,549 INFO L418 AbstractCegarLoop]: === Iteration 25 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -354280040, now seen corresponding path program 1 times [2019-08-05 11:07:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:42,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:07:42,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:42,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:42,799 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 11:07:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:42,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:42,800 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand 5 states. [2019-08-05 11:07:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:43,268 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2019-08-05 11:07:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:43,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 11:07:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:43,270 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:07:43,270 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:07:43,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:07:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-08-05 11:07:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:07:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2019-08-05 11:07:43,274 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 14 [2019-08-05 11:07:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:43,274 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2019-08-05 11:07:43,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2019-08-05 11:07:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:07:43,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:43,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:43,276 INFO L418 AbstractCegarLoop]: === Iteration 26 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 276010988, now seen corresponding path program 1 times [2019-08-05 11:07:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:43,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:43,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:43,337 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 11:07:43,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:43,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:43,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:43,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:43,338 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 4 states. [2019-08-05 11:07:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:43,450 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2019-08-05 11:07:43,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:43,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-08-05 11:07:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:43,452 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:07:43,452 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:07:43,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 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 11:07:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:07:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-08-05 11:07:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:07:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-08-05 11:07:43,457 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 14 [2019-08-05 11:07:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:43,457 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-08-05 11:07:43,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-08-05 11:07:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:07:43,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:43,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:43,458 INFO L418 AbstractCegarLoop]: === Iteration 27 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1157956452, now seen corresponding path program 1 times [2019-08-05 11:07:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:43,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:43,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:43,501 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 11:07:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:43,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:43,502 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 4 states. [2019-08-05 11:07:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:43,559 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-08-05 11:07:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:43,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-08-05 11:07:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:43,560 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:07:43,561 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:07:43,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 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 11:07:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:07:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-08-05 11:07:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:07:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2019-08-05 11:07:43,563 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 14 [2019-08-05 11:07:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:43,563 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2019-08-05 11:07:43,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2019-08-05 11:07:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:07:43,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:43,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:43,564 INFO L418 AbstractCegarLoop]: === Iteration 28 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1041482886, now seen corresponding path program 1 times [2019-08-05 11:07:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:43,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:43,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:43,707 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:07:43,708 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 11:07:43,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:43,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:43,709 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand 3 states. [2019-08-05 11:07:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:43,802 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-08-05 11:07:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:43,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 11:07:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:43,803 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:07:43,803 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:07:43,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:07:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:07:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:07:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2019-08-05 11:07:43,806 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 16 [2019-08-05 11:07:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:43,806 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2019-08-05 11:07:43,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2019-08-05 11:07:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:07:43,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:43,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:43,807 INFO L418 AbstractCegarLoop]: === Iteration 29 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -137657008, now seen corresponding path program 1 times [2019-08-05 11:07:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:43,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:43,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:43,883 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 11:07:43,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:43,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:43,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:43,884 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 3 states. [2019-08-05 11:07:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:43,920 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2019-08-05 11:07:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:43,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 11:07:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:43,921 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:07:43,921 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:07:43,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 11:07:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:07:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:07:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:07:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2019-08-05 11:07:43,924 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 18 [2019-08-05 11:07:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:43,924 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2019-08-05 11:07:43,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2019-08-05 11:07:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:07:43,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:43,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:43,925 INFO L418 AbstractCegarLoop]: === Iteration 30 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash 27600494, now seen corresponding path program 1 times [2019-08-05 11:07:43,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:43,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:44,056 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 11:07:44,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:44,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:44,057 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand 5 states. [2019-08-05 11:07:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:44,241 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2019-08-05 11:07:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:44,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-08-05 11:07:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:44,243 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:07:44,243 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:07:44,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:07:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2019-08-05 11:07:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:07:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2019-08-05 11:07:44,247 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 19 [2019-08-05 11:07:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:44,247 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2019-08-05 11:07:44,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2019-08-05 11:07:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:07:44,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:44,248 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 11:07:44,248 INFO L418 AbstractCegarLoop]: === Iteration 31 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash 507946959, now seen corresponding path program 1 times [2019-08-05 11:07:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:44,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:44,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,316 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 11:07:44,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:44,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:44,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:44,318 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 5 states. [2019-08-05 11:07:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:44,367 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-08-05 11:07:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:44,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 11:07:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:44,368 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:07:44,368 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:07:44,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:07:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-08-05 11:07:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:07:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-08-05 11:07:44,372 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 21 [2019-08-05 11:07:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:44,372 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-08-05 11:07:44,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-08-05 11:07:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:07:44,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:44,373 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 11:07:44,374 INFO L418 AbstractCegarLoop]: === Iteration 32 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2045262518, now seen corresponding path program 1 times [2019-08-05 11:07:44,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:44,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:44,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,434 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 11:07:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:44,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:44,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:44,435 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 4 states. [2019-08-05 11:07:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:44,477 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2019-08-05 11:07:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:44,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 11:07:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:44,478 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:07:44,478 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:07:44,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 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 11:07:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:07:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-08-05 11:07:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:07:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-08-05 11:07:44,482 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 21 [2019-08-05 11:07:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:44,482 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-08-05 11:07:44,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-08-05 11:07:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:07:44,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:44,483 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 11:07:44,484 INFO L418 AbstractCegarLoop]: === Iteration 33 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -897669917, now seen corresponding path program 1 times [2019-08-05 11:07:44,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:44,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:44,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,547 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 11:07:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:44,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:44,548 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 5 states. [2019-08-05 11:07:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:44,642 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2019-08-05 11:07:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:44,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 11:07:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:44,643 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:07:44,644 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:07:44,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:07:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-08-05 11:07:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:07:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2019-08-05 11:07:44,648 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 21 [2019-08-05 11:07:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:44,648 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2019-08-05 11:07:44,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2019-08-05 11:07:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:07:44,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:44,649 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 11:07:44,649 INFO L418 AbstractCegarLoop]: === Iteration 34 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 754285378, now seen corresponding path program 1 times [2019-08-05 11:07:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:44,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:44,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,733 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 11:07:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:44,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:44,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:44,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:44,734 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2019-08-05 11:07:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:44,771 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2019-08-05 11:07:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:44,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 11:07:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:44,773 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:07:44,773 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:07:44,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 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 11:07:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:07:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2019-08-05 11:07:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:07:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2019-08-05 11:07:44,776 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 21 [2019-08-05 11:07:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:44,777 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2019-08-05 11:07:44,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2019-08-05 11:07:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:07:44,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:44,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:44,778 INFO L418 AbstractCegarLoop]: === Iteration 35 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 451785006, now seen corresponding path program 1 times [2019-08-05 11:07:44,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:44,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:44,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:45,062 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 11:07:45,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:45,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:45,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:45,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:45,088 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2019-08-05 11:07:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:45,342 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2019-08-05 11:07:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:45,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-08-05 11:07:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:45,344 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:07:45,344 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:07:45,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:07:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-08-05 11:07:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:07:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-08-05 11:07:45,347 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 25 [2019-08-05 11:07:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:45,348 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-08-05 11:07:45,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-08-05 11:07:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:07:45,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:45,348 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:45,349 INFO L418 AbstractCegarLoop]: === Iteration 36 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1923779119, now seen corresponding path program 1 times [2019-08-05 11:07:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:45,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:45,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:45,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:45,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:45,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:45,587 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 5 states. [2019-08-05 11:07:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,235 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-08-05 11:07:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:46,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 11:07:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,236 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:07:46,236 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:07:46,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:07:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:07:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:07:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-08-05 11:07:46,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 27 [2019-08-05 11:07:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,238 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-08-05 11:07:46,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-08-05 11:07:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:07:46,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:46,239 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:46,240 INFO L418 AbstractCegarLoop]: === Iteration 37 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr18ENSURES_VIOLATIONPOST_CONDITION, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr11ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr19ASSERT_VIOLATIONASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr10ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr9ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr18ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr12ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr8ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr17ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr16ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr13ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr15ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr14ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash 373703888, now seen corresponding path program 1 times [2019-08-05 11:07:46,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:46,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:07:46,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:46,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:46,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:46,396 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 5 states. [2019-08-05 11:07:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,478 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-08-05 11:07:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:46,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 11:07:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,479 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:07:46,479 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:07:46,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:07:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:07:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:07:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:07:46,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-08-05 11:07:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,481 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:07:46,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:07:46,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:07:46,487 INFO L202 PluginConnector]: Adding new model encT_TRE_with_Boogie_Specs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:07:46 BoogieIcfgContainer [2019-08-05 11:07:46,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:07:46,489 INFO L168 Benchmark]: Toolchain (without parser) took 13206.53 ms. Allocated memory was 141.0 MB in the beginning and 284.2 MB in the end (delta: 143.1 MB). Free memory was 110.2 MB in the beginning and 90.0 MB in the end (delta: 20.2 MB). Peak memory consumption was 163.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:46,490 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:07:46,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.43 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 106.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:46,491 INFO L168 Benchmark]: Boogie Preprocessor took 69.86 ms. Allocated memory is still 141.0 MB. Free memory was 106.8 MB in the beginning and 104.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:46,492 INFO L168 Benchmark]: RCFGBuilder took 2333.43 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 104.7 MB in the beginning and 122.0 MB in the end (delta: -17.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:46,492 INFO L168 Benchmark]: TraceAbstraction took 10705.13 ms. Allocated memory was 177.2 MB in the beginning and 284.2 MB in the end (delta: 107.0 MB). Free memory was 122.0 MB in the beginning and 90.0 MB in the end (delta: 32.0 MB). Peak memory consumption was 139.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:46,496 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.43 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 106.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.86 ms. Allocated memory is still 141.0 MB. Free memory was 106.8 MB in the beginning and 104.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2333.43 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 104.7 MB in the beginning and 122.0 MB in the end (delta: -17.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10705.13 ms. Allocated memory was 177.2 MB in the beginning and 284.2 MB in the end (delta: 107.0 MB). Free memory was 122.0 MB in the beginning and 90.0 MB in the end (delta: 32.0 MB). Peak memory consumption was 139.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 28]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 28]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 131]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 99]: procedure postcondition always holds and assertion always holds For all program executions holds that procedure postcondition always holds and assertion always holds at this location - PositiveResult [Line: 121]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 141 locations, 44 error locations. SAFE Result, 10.6s OverallTime, 37 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4820 SDtfs, 2638 SDslu, 8012 SDs, 0 SdLazy, 1234 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 446 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 12682 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1998 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...