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-Light.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:35,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:35,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:35,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:35,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:35,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:35,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:35,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:35,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:35,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:35,060 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:35,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:35,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:35,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:35,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:35,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:35,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:35,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:35,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:35,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:35,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:35,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:35,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:35,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:35,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:35,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:35,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:35,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:35,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:35,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:35,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:35,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:35,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:35,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:07:35,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:07:35,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:07:35,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:07:35,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:07:35,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:07:35,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:07:35,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:07:35,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:07:35,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:07:35,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:07:35,149 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:07:35,150 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:07:35,150 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-Light.bpl [2019-08-05 11:07:35,151 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/CTL/encT_TRE_with_Boogie_Specs-Light.bpl' [2019-08-05 11:07:35,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:07:35,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:07:35,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:35,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:07:35,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:07:35,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,242 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:07:35,242 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:07:35,242 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:07:35,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:35,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:07:35,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:07:35,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:07:35,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/1) ... [2019-08-05 11:07:35,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:07:35,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:07:35,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:07:35,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:07:35,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (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:35,402 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encLT given in one single declaration [2019-08-05 11:07:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure encLT [2019-08-05 11:07:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure encLT [2019-08-05 11:07:35,403 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encRLT given in one single declaration [2019-08-05 11:07:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure encRLT [2019-08-05 11:07:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure encRLT [2019-08-05 11:07:35,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encT given in one single declaration [2019-08-05 11:07:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure encT [2019-08-05 11:07:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure encT [2019-08-05 11:07:35,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Test given in one single declaration [2019-08-05 11:07:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure Test [2019-08-05 11:07:35,405 INFO L138 BoogieDeclarations]: Found implementation of procedure Test [2019-08-05 11:07:35,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encLLT given in one single declaration [2019-08-05 11:07:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure encLLT [2019-08-05 11:07:35,406 INFO L138 BoogieDeclarations]: Found implementation of procedure encLLT [2019-08-05 11:07:36,582 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:07:36,583 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 11:07:36,584 INFO L202 PluginConnector]: Adding new model encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:36 BoogieIcfgContainer [2019-08-05 11:07:36,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:07:36,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:07:36,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:07:36,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:07:36,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:35" (1/2) ... [2019-08-05 11:07:36,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da2b3e and model type encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:07:36, skipping insertion in model container [2019-08-05 11:07:36,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:36" (2/2) ... [2019-08-05 11:07:36,592 INFO L109 eAbstractionObserver]: Analyzing ICFG encT_TRE_with_Boogie_Specs-Light.bpl [2019-08-05 11:07:36,601 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:07:36,609 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-08-05 11:07:36,625 INFO L252 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-08-05 11:07:36,649 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:07:36,650 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:07:36,650 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:07:36,650 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:07:36,650 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:07:36,651 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:07:36,651 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:07:36,651 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:07:36,651 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:07:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-08-05 11:07:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:36,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:36,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:36,680 INFO L418 AbstractCegarLoop]: === Iteration 1 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash 8464, now seen corresponding path program 1 times [2019-08-05 11:07:36,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:36,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:36,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:36,868 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,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:36,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:36,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:36,886 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-08-05 11:07:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:36,926 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-08-05 11:07:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:36,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:36,941 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:07:36,941 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:07:36,943 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,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:07:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:07:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:07:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-08-05 11:07:36,983 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 2 [2019-08-05 11:07:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:36,984 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-08-05 11:07:36,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-08-05 11:07:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:36,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:36,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:36,986 INFO L418 AbstractCegarLoop]: === Iteration 2 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash 7937, now seen corresponding path program 1 times [2019-08-05 11:07:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:36,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:36,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,066 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,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:37,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,069 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-08-05 11:07:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,075 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-08-05 11:07:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,077 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:07:37,077 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:07:37,078 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:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:07:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:07:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:07:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-08-05 11:07:37,086 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 2 [2019-08-05 11:07:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,086 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-08-05 11:07:37,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-08-05 11:07:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:37,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:37,088 INFO L418 AbstractCegarLoop]: === Iteration 3 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 8315, now seen corresponding path program 1 times [2019-08-05 11:07:37,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,153 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,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,155 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 3 states. [2019-08-05 11:07:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,166 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-08-05 11:07:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,169 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:07:37,169 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:07:37,169 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:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:07:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:07:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:07:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:07:37,187 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 2 [2019-08-05 11:07:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,188 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:07:37,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:07:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:37,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:37,191 INFO L418 AbstractCegarLoop]: === Iteration 4 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash 150510, now seen corresponding path program 1 times [2019-08-05 11:07:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,349 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2019-08-05 11:07:37,349 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,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,351 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2019-08-05 11:07:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,377 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-08-05 11:07:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:07:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,379 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:07:37,379 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:07:37,380 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,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:07:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-05 11:07:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:07:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-08-05 11:07:37,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 3 [2019-08-05 11:07:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,386 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-08-05 11:07:37,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-08-05 11:07:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:37,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:37,388 INFO L418 AbstractCegarLoop]: === Iteration 5 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 68678, now seen corresponding path program 1 times [2019-08-05 11:07:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,465 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,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,467 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2019-08-05 11:07:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,484 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2019-08-05 11:07:37,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:07:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,488 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:07:37,488 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:07:37,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:07:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-08-05 11:07:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:07:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-08-05 11:07:37,494 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 3 [2019-08-05 11:07:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,495 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-08-05 11:07:37,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-08-05 11:07:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:07:37,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:07:37,497 INFO L418 AbstractCegarLoop]: === Iteration 6 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 7998950, now seen corresponding path program 1 times [2019-08-05 11:07:37,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,605 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,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,607 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2019-08-05 11:07:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,642 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-08-05 11:07:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:07:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,649 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:07:37,649 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:07:37,650 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,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:07:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-08-05 11:07:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:07:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-08-05 11:07:37,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 4 [2019-08-05 11:07:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,661 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-08-05 11:07:37,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-08-05 11:07:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:07:37,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:07:37,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 7992041, now seen corresponding path program 1 times [2019-08-05 11:07:37,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,753 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,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,755 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 3 states. [2019-08-05 11:07:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,796 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-08-05 11:07:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:07:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,798 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:07:37,798 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:07:37,798 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,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:07:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:07:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:07:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-08-05 11:07:37,802 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 4 [2019-08-05 11:07:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,803 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-08-05 11:07:37,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-08-05 11:07:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:37,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:37,804 INFO L418 AbstractCegarLoop]: === Iteration 8 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 66002067, now seen corresponding path program 1 times [2019-08-05 11:07:37,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:37,837 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,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:37,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:37,838 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 3 states. [2019-08-05 11:07:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,929 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-08-05 11:07:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:37,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:07:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,932 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:07:37,932 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:07:37,932 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,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:07:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-08-05 11:07:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:07:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2019-08-05 11:07:37,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 5 [2019-08-05 11:07:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,939 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-08-05 11:07:37,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2019-08-05 11:07:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:37,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:37,943 INFO L418 AbstractCegarLoop]: === Iteration 9 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash 144648281, now seen corresponding path program 1 times [2019-08-05 11:07:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:37,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:37,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,066 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,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:38,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:38,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:38,067 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 4 states. [2019-08-05 11:07:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,200 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-08-05 11:07:38,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:38,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:07:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,202 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:07:38,202 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:07:38,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:07:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2019-08-05 11:07:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:07:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-08-05 11:07:38,212 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 5 [2019-08-05 11:07:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,212 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-08-05 11:07:38,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-08-05 11:07:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:38,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:38,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 144645339, now seen corresponding path program 1 times [2019-08-05 11:07:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,289 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,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:38,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:38,290 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 3 states. [2019-08-05 11:07:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:38,434 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2019-08-05 11:07:38,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:38,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:07:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:38,436 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:07:38,436 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:07:38,437 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,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:07:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-08-05 11:07:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:07:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-08-05 11:07:38,441 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 5 [2019-08-05 11:07:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:38,441 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-08-05 11:07:38,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-08-05 11:07:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:38,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:38,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:38,443 INFO L418 AbstractCegarLoop]: === Iteration 11 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash 247967505, now seen corresponding path program 1 times [2019-08-05 11:07:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:38,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:07:38,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,631 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:07:38,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:38,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:38,920 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:07:38,922 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,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:38,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:38,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:38,925 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 6 states. [2019-08-05 11:07:39,108 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-08-05 11:07:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,215 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-08-05 11:07:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:39,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:07:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,216 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:07:39,216 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:07:39,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:07:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:07:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:07:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-08-05 11:07:39,220 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 5 [2019-08-05 11:07:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,220 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-08-05 11:07:39,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-08-05 11:07:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:07:39,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:07:39,222 INFO L418 AbstractCegarLoop]: === Iteration 12 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 66007582, now seen corresponding path program 1 times [2019-08-05 11:07:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:39,324 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,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:39,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:39,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:39,326 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 4 states. [2019-08-05 11:07:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,361 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 11:07:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:39,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:07:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,363 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:07:39,363 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:07:39,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:07:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2019-08-05 11:07:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:07:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-08-05 11:07:39,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 5 [2019-08-05 11:07:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,367 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-08-05 11:07:39,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-08-05 11:07:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:07:39,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:07:39,369 INFO L418 AbstractCegarLoop]: === Iteration 13 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2046235133, now seen corresponding path program 1 times [2019-08-05 11:07:39,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:39,429 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,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:39,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:39,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:39,431 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2019-08-05 11:07:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,552 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-08-05 11:07:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:39,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:07:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,553 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:07:39,553 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:07:39,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:07:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-08-05 11:07:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:07:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-08-05 11:07:39,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 6 [2019-08-05 11:07:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,557 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-08-05 11:07:39,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2019-08-05 11:07:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:07:39,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:07:39,559 INFO L418 AbstractCegarLoop]: === Iteration 14 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 189129591, now seen corresponding path program 1 times [2019-08-05 11:07:39,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:39,612 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,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:39,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:39,614 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 5 states. [2019-08-05 11:07:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,924 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-08-05 11:07:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:39,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:07:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,926 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:07:39,926 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:07:39,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:07:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2019-08-05 11:07:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:07:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-08-05 11:07:39,930 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 6 [2019-08-05 11:07:39,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,930 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-08-05 11:07:39,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-08-05 11:07:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:39,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:39,932 INFO L418 AbstractCegarLoop]: === Iteration 15 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash -996519992, now seen corresponding path program 1 times [2019-08-05 11:07:39,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:39,968 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,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:39,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:39,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:39,969 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 4 states. [2019-08-05 11:07:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,066 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2019-08-05 11:07:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,068 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:07:40,068 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:07:40,069 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,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:07:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2019-08-05 11:07:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:07:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2019-08-05 11:07:40,074 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 7 [2019-08-05 11:07:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-08-05 11:07:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2019-08-05 11:07:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:40,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,077 INFO L418 AbstractCegarLoop]: === Iteration 16 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1565223092, now seen corresponding path program 1 times [2019-08-05 11:07:40,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,143 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,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,145 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 4 states. [2019-08-05 11:07:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,215 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-08-05 11:07:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,216 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:07:40,216 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:07:40,217 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,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:07:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2019-08-05 11:07:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:07:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-08-05 11:07:40,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 7 [2019-08-05 11:07:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,219 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-08-05 11:07:40,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-08-05 11:07:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,221 INFO L418 AbstractCegarLoop]: === Iteration 17 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash -827349091, now seen corresponding path program 1 times [2019-08-05 11:07:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,254 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,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,256 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 3 states. [2019-08-05 11:07:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,286 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2019-08-05 11:07:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:40,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:07:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,287 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:07:40,287 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:07:40,287 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,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:07:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:07:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:07:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-08-05 11:07:40,290 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 8 [2019-08-05 11:07:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,290 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-08-05 11:07:40,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-08-05 11:07:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,292 INFO L418 AbstractCegarLoop]: === Iteration 18 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1364916304, now seen corresponding path program 1 times [2019-08-05 11:07:40,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,351 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,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,353 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 4 states. [2019-08-05 11:07:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,385 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-08-05 11:07:40,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:07:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,386 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:07:40,387 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:07:40,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:07:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-08-05 11:07:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:07:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2019-08-05 11:07:40,390 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 8 [2019-08-05 11:07:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,390 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-08-05 11:07:40,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2019-08-05 11:07:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,392 INFO L418 AbstractCegarLoop]: === Iteration 19 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash -663055694, now seen corresponding path program 1 times [2019-08-05 11:07:40,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,469 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,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,471 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 4 states. [2019-08-05 11:07:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,508 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-08-05 11:07:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:07:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,510 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:07:40,510 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:07:40,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:07:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-08-05 11:07:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:07:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-08-05 11:07:40,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 8 [2019-08-05 11:07:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,514 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-08-05 11:07:40,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-08-05 11:07:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:40,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,516 INFO L418 AbstractCegarLoop]: === Iteration 20 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1277276142, now seen corresponding path program 1 times [2019-08-05 11:07:40,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,548 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,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,549 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 3 states. [2019-08-05 11:07:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,571 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-08-05 11:07:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:40,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:07:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,576 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:07:40,576 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:07:40,576 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,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:07:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 11:07:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:07:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-08-05 11:07:40,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 8 [2019-08-05 11:07:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,579 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-08-05 11:07:40,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-08-05 11:07:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:40,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,581 INFO L418 AbstractCegarLoop]: === Iteration 21 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 121986253, now seen corresponding path program 1 times [2019-08-05 11:07:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:40,671 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,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,672 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-08-05 11:07:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,697 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-08-05 11:07:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:07:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,698 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:07:40,698 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:07:40,699 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:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:07:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 11:07:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:07:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:07:40,702 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 9 [2019-08-05 11:07:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,702 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:07:40,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:07:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:40,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,703 INFO L418 AbstractCegarLoop]: === Iteration 22 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 940854976, now seen corresponding path program 1 times [2019-08-05 11:07:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,734 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,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:40,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,736 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2019-08-05 11:07:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,750 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-08-05 11:07:40,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:40,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:07:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,754 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:07:40,755 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:07:40,755 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:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:07:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:07:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:07:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-08-05 11:07:40,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 9 [2019-08-05 11:07:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,757 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-08-05 11:07:40,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-08-05 11:07:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:40,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,759 INFO L418 AbstractCegarLoop]: === Iteration 23 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash 940857387, now seen corresponding path program 1 times [2019-08-05 11:07:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:40,806 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,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:40,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:40,807 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2019-08-05 11:07:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,832 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-08-05 11:07:40,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:40,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:07:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,834 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:07:40,834 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:07:40,834 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:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:07:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-08-05 11:07:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:07:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-08-05 11:07:40,838 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 9 [2019-08-05 11:07:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,838 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-08-05 11:07:40,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-08-05 11:07:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:07:40,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,840 INFO L418 AbstractCegarLoop]: === Iteration 24 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1541370569, now seen corresponding path program 1 times [2019-08-05 11:07:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,893 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,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,895 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 3 states. [2019-08-05 11:07:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:40,922 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-08-05 11:07:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:40,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 11:07:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:40,923 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:07:40,923 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:07:40,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:07:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:07:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:07:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-08-05 11:07:40,926 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 10 [2019-08-05 11:07:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:40,927 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-08-05 11:07:40,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-08-05 11:07:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:07:40,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:40,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:40,928 INFO L418 AbstractCegarLoop]: === Iteration 25 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1719562439, now seen corresponding path program 1 times [2019-08-05 11:07:40,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,983 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,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:40,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:40,985 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-08-05 11:07:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,005 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-08-05 11:07:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:41,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 11:07:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,006 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:07:41,006 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:07:41,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:07:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:07:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:07:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-08-05 11:07:41,009 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2019-08-05 11:07:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,009 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-08-05 11:07:41,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-08-05 11:07:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:07:41,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,010 INFO L418 AbstractCegarLoop]: === Iteration 26 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1062896467, now seen corresponding path program 1 times [2019-08-05 11:07:41,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,189 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:07:41,189 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,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:41,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:41,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:41,191 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 3 states. [2019-08-05 11:07:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,195 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-08-05 11:07:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:41,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:07:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,197 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:07:41,197 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:07:41,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:07:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-08-05 11:07:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:07:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-08-05 11:07:41,199 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2019-08-05 11:07:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,199 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-08-05 11:07:41,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-08-05 11:07:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:07:41,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,201 INFO L418 AbstractCegarLoop]: === Iteration 27 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash 506608776, now seen corresponding path program 1 times [2019-08-05 11:07:41,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,243 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,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:41,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:41,244 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-08-05 11:07:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,260 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-08-05 11:07:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:41,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:07:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,261 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:07:41,261 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:07:41,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:07:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-08-05 11:07:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:07:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-08-05 11:07:41,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2019-08-05 11:07:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,263 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-08-05 11:07:41,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-08-05 11:07:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:07:41,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,264 INFO L418 AbstractCegarLoop]: === Iteration 28 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1474996999, now seen corresponding path program 1 times [2019-08-05 11:07:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:41,362 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,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:41,364 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-08-05 11:07:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,454 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-08-05 11:07:41,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:41,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:07:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,456 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:07:41,456 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:07:41,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:07:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-08-05 11:07:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:07:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-08-05 11:07:41,459 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2019-08-05 11:07:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,459 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-08-05 11:07:41,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-08-05 11:07:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:07:41,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,460 INFO L418 AbstractCegarLoop]: === Iteration 29 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1409948107, now seen corresponding path program 1 times [2019-08-05 11:07:41,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,537 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,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:41,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:41,539 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2019-08-05 11:07:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,556 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-08-05 11:07:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:41,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:07:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,557 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:07:41,557 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:41,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:07:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:07:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:07:41,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2019-08-05 11:07:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,560 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:07:41,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:07:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:07:41,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:41,561 INFO L418 AbstractCegarLoop]: === Iteration 30 === [encLTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLTErr2ENSURES_VIOLATIONPOST_CONDITION, encLTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encRLTErr0ENSURES_VIOLATIONPOST_CONDITION, encTErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr6ENSURES_VIOLATIONPOST_CONDITION, encTErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encTErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr0ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr5ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr6ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr7ASSERT_VIOLATIONASSERT, TestErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr1ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr4ASSERT_VIOLATIONPOST_CONDITIONandASSERT, TestErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, encLLTErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 11:07:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash -132904120, now seen corresponding path program 1 times [2019-08-05 11:07:41,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:41,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:41,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,606 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,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:41,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:41,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:41,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:41,607 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-08-05 11:07:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,620 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 11:07:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:41,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 11:07:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,621 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:41,621 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:07:41,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:07:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:07:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:07:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:07:41,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-08-05 11:07:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,623 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:07:41,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:07:41,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:07:41,628 INFO L202 PluginConnector]: Adding new model encT_TRE_with_Boogie_Specs-Light.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:07:41 BoogieIcfgContainer [2019-08-05 11:07:41,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:07:41,629 INFO L168 Benchmark]: Toolchain (without parser) took 6422.05 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 111.5 MB in the beginning and 155.3 MB in the end (delta: -43.8 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,630 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 135.3 MB. Free memory was 112.7 MB in the beginning and 112.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.82 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 108.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,632 INFO L168 Benchmark]: Boogie Preprocessor took 58.03 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,632 INFO L168 Benchmark]: RCFGBuilder took 1258.60 ms. Allocated memory is still 135.3 MB. Free memory was 107.0 MB in the beginning and 71.3 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,633 INFO L168 Benchmark]: TraceAbstraction took 5042.09 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 71.0 MB in the beginning and 155.3 MB in the end (delta: -84.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:41,637 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.26 ms. Allocated memory is still 135.3 MB. Free memory was 112.7 MB in the beginning and 112.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.82 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 108.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.03 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1258.60 ms. Allocated memory is still 135.3 MB. Free memory was 107.0 MB in the beginning and 71.3 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5042.09 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 71.0 MB in the beginning and 155.3 MB in the end (delta: -84.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 97]: 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: 75]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 107]: 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: 107]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 75]: 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: 107]: 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: 97]: 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: 107]: 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: 75]: 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: 97]: 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: 97]: 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: 75]: 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: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 75]: 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: 107]: 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: 107]: 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: 97]: 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: 97]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 69 locations, 20 error locations. SAFE Result, 4.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1689 SDtfs, 546 SDslu, 2143 SDs, 0 SdLazy, 268 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, 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.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 203 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 3255 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1163 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...