java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:19,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:19,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:19,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:19,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:19,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:19,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:19,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:19,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:19,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:19,880 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:19,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:19,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:19,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:19,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:19,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:19,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:19,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:19,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:19,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:19,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:19,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:19,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:19,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:19,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:19,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:19,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:19,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:19,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:19,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:19,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:19,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:19,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:19,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:19,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:19,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:19,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:19,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:19,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:19,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:19,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:19,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:19,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:19,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:19,952 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:19,952 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:19,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2019-08-04 21:21:19,953 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2019-08-04 21:21:19,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:19,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:19,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:19,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:19,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:20,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,023 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:20,023 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:20,023 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:20,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:20,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:20,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:20,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:20,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/1) ... [2019-08-04 21:21:20,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:20,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:20,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:20,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:20,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (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-04 21:21:20,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2019-08-04 21:21:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2019-08-04 21:21:20,126 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2019-08-04 21:21:20,515 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:20,516 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:20,517 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:20 BoogieIcfgContainer [2019-08-04 21:21:20,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:20,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:20,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:20,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:20,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:19" (1/2) ... [2019-08-04 21:21:20,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402924e0 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:20, skipping insertion in model container [2019-08-04 21:21:20,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:20" (2/2) ... [2019-08-04 21:21:20,526 INFO L109 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2019-08-04 21:21:20,536 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:20,544 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:21:20,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:21:20,590 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:20,591 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:20,591 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:20,591 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:20,591 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:20,591 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:20,592 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:20,592 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:20,592 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:21:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:21:20,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:20,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:21:20,619 INFO L418 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-08-04 21:21:20,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:20,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:21:20,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:20,846 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-04 21:21:20,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:20,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:21:20,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:21:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:21:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:21:20,867 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:21:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:20,906 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:21:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:21:20,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:21:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:20,924 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:21:20,925 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:21:20,927 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-04 21:21:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:21:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:21:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:21:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:21:20,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:21:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:20,966 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:21:20,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:21:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:21:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:21:20,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:20,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:21:20,968 INFO L418 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2019-08-04 21:21:20,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:20,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:20,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:21,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:21:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:21,171 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-04 21:21:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:21,342 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:21:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:21:21,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-04 21:21:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:21,343 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:21:21,343 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:21:21,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:21:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:21:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:21:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:21:21,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:21:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:21,347 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:21:21,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:21:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:21:21,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:21,348 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:21:21,348 INFO L418 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2019-08-04 21:21:21,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:21,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:21:21,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:21,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,567 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-04 21:21:21,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,830 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-08-04 21:21:21,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:21,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:21:21,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:21,857 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-04 21:21:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:21,997 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:21:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:21,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-04 21:21:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:21,998 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:21:21,998 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:21:21,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:21:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:21:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:21:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:21:22,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:21:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:22,002 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:21:22,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:21:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:22,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:22,003 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:21:22,004 INFO L418 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2019-08-04 21:21:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:22,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:21:22,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:22,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,264 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-04 21:21:22,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,424 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-08-04 21:21:22,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,650 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-04 21:21:22,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:22,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:22,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:22,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:22,670 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-04 21:21:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:22,753 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:21:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:21:22,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-04 21:21:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:22,755 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:21:22,755 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:21:22,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:21:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:21:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:21:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:21:22,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:21:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:22,759 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:21:22,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:21:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:22,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:22,760 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:21:22,761 INFO L418 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2019-08-04 21:21:22,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:22,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:21:22,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:22,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:22,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,361 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-04 21:21:23,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:23,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:23,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:23,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:23,496 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-04 21:21:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:23,586 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:21:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:23,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-04 21:21:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:23,587 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:21:23,588 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:21:23,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:21:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:21:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:21:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:21:23,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:21:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:23,591 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:21:23,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:21:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:21:23,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:23,592 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:21:23,592 INFO L418 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2019-08-04 21:21:23,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:23,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:21:23,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:23,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:23,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,140 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-04 21:21:24,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:24,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:24,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:21:24,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:21:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:21:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:24,248 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-04 21:21:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:24,327 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:21:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:24,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-04 21:21:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:24,329 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:21:24,329 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:21:24,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:21:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:21:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:21:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:21:24,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:21:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:21:24,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:21:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:21:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:24,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:24,334 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:21:24,334 INFO L418 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2019-08-04 21:21:24,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:24,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:21:24,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:24,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:24,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:21:24,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:21:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:21:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:24,811 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-04 21:21:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:24,889 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:21:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:24,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-04 21:21:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:24,891 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:21:24,891 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:21:24,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:21:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:21:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:21:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:21:24,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:21:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:24,895 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:21:24,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:21:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:21:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:24,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:24,896 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:21:24,897 INFO L418 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2019-08-04 21:21:24,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:24,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:21:24,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:24,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:25,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:25,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:21:25,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:21:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:21:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:25,812 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-04 21:21:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:25,903 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:21:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:21:25,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-04 21:21:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:25,904 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:21:25,905 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:21:25,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:21:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:21:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:21:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:21:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:21:25,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:21:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:25,908 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:21:25,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:21:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:21:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:21:25,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:25,909 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:21:25,909 INFO L418 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:25,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2019-08-04 21:21:25,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:25,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:21:25,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:25,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:26,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:21:26,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:21:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:21:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:21:26,399 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-04 21:21:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:26,479 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:21:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:21:26,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-04 21:21:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:26,480 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:21:26,480 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:21:26,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:21:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:21:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:21:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:21:26,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:21:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:26,483 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:21:26,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:21:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:21:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:26,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:26,483 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:21:26,484 INFO L418 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2019-08-04 21:21:26,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:26,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:26,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:26,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,806 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-04 21:21:26,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:26,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:27,343 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-04 21:21:27,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:27,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:27,640 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-04 21:21:27,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:27,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:27,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,271 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-08-04 21:21:28,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:21:28,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:21:28,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:21:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:28,834 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-04 21:21:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:28,917 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:21:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:28,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-04 21:21:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:28,919 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:21:28,919 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:21:28,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:21:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:21:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:21:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:21:28,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:21:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:28,924 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:21:28,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:21:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:21:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:28,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:28,925 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:21:28,925 INFO L418 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2019-08-04 21:21:28,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:28,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:21:28,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:28,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:21:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:29,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:21:29,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:21:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:21:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:29,659 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-04 21:21:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:29,721 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:21:29,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:29,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-04 21:21:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:29,723 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:21:29,723 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:21:29,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:21:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:21:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:21:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:21:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:21:29,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:21:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:29,727 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:21:29,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:21:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:21:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:29,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:29,728 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:21:29,728 INFO L418 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2019-08-04 21:21:29,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:21:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:21:29,810 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:21:29,835 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:21:29 BoogieIcfgContainer [2019-08-04 21:21:29,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:21:29,837 INFO L168 Benchmark]: Toolchain (without parser) took 9848.01 ms. Allocated memory was 134.2 MB in the beginning and 233.3 MB in the end (delta: 99.1 MB). Free memory was 111.6 MB in the beginning and 93.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 117.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,838 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.74 ms. Allocated memory is still 134.2 MB. Free memory was 111.6 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,840 INFO L168 Benchmark]: Boogie Preprocessor took 23.12 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,841 INFO L168 Benchmark]: RCFGBuilder took 467.65 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 95.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,842 INFO L168 Benchmark]: TraceAbstraction took 9316.79 ms. Allocated memory was 134.2 MB in the beginning and 233.3 MB in the end (delta: 99.1 MB). Free memory was 95.1 MB in the beginning and 93.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:29,846 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.74 ms. Allocated memory is still 134.2 MB. Free memory was 111.6 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.12 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.65 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 95.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9316.79 ms. Allocated memory was 134.2 MB in the beginning and 233.3 MB in the end (delta: 99.1 MB). Free memory was 95.1 MB in the beginning and 93.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L15] one := 1; [L16] maxGatePosition := 100 * one; [L17] thousand := 1000 * one; [L20] gate := 0; [L21] time := 0; [L22] alarm := false; VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=10, time_increment=10] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=109, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=208, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=307, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=406, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=505, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=604, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=703, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=802, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=901, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 9.2s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 1 SDslu, 14 SDs, 0 SdLazy, 186 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=11, 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 77 ConstructedInterpolants, 66 QuantifiedInterpolants, 14520 SizeOfPredicates, 88 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...