java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:26,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:26,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:26,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:26,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:26,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:26,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:26,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:26,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:26,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:26,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:26,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:26,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:26,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:26,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:26,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:26,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:26,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:26,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:26,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:26,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:26,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:26,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:26,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:26,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:26,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:26,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:26,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:26,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:26,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:26,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:26,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:26,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:26,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:26,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:26,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:26,536 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:36:26,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:26,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:26,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:26,554 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:26,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:26,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:26,555 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:26,555 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:26,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:26,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:26,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:26,651 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:26,652 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:26,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-07-23 13:36:26,654 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-07-23 13:36:26,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:26,708 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:26,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:26,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:26,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:26,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:26,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:26,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:26,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:26,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,858 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-07-23 13:36:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-07-23 13:36:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-07-23 13:36:27,055 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:27,056 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:27 BoogieIcfgContainer [2018-07-23 13:36:27,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:27,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:27,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:27,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:27,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/2) ... [2018-07-23 13:36:27,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2657a2a6 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:27, skipping insertion in model container [2018-07-23 13:36:27,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:27" (2/2) ... [2018-07-23 13:36:27,072 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-07-23 13:36:27,080 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:27,089 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:36:27,132 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:27,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:27,133 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:27,133 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:27,133 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:27,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:27,134 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:27,134 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:27,134 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:36:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:36:27,157 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,158 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:36:27,159 INFO L414 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-07-23 13:36:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,240 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:27,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:36:27,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,243 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= (+ GateController_time 1000) GateController_thousand)] [2018-07-23 13:36:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:36:27,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:36:27,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:36:27,262 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:36:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,290 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:36:27,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:36:27,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:36:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,305 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:36:27,306 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:36:27,309 INFO L575 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 [2018-07-23 13:36:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:36:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:36:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:36:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:36:27,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:36:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:36:27,345 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:36:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:36:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:27,346 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,346 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:27,346 INFO L414 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-07-23 13:36:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:36:27,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,390 INFO L185 omatonBuilderFactory]: Interpolants [39#true, 40#false, 41#(<= (+ GateController_time 1000) GateController_thousand), 42#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 43#GateController_alarm] [2018-07-23 13:36:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:27,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:27,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:27,394 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-23 13:36:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,420 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:36:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:36:27,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,421 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:36:27,421 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:36:27,422 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:36:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:36:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:36:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:36:27,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:36:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,426 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:36:27,426 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:36:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:36:27,427 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,427 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:36:27,427 INFO L414 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-07-23 13:36:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:36:27,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,490 INFO L185 omatonBuilderFactory]: Interpolants [72#true, 73#false, 74#(<= (+ GateController_time 1000) GateController_thousand), 75#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 76#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 77#GateController_alarm] [2018-07-23 13:36:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:27,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:27,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:27,492 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-23 13:36:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,517 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:36:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:27,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 13:36:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,519 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:36:27,519 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:36:27,520 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:36:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:36:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:36:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:36:27,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:36:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,523 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:36:27,523 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:36:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:27,524 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,524 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:36:27,525 INFO L414 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-07-23 13:36:27,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:36:27,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,621 INFO L185 omatonBuilderFactory]: Interpolants [112#(<= (+ GateController_time 1000) GateController_thousand), 113#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 114#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 115#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 116#GateController_alarm, 110#true, 111#false] [2018-07-23 13:36:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:27,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:27,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:27,623 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-23 13:36:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,655 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:36:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:27,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,657 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:36:27,657 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:36:27,657 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:36:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:36:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:36:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:36:27,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:36:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:36:27,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:36:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:27,665 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,665 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:36:27,665 INFO L414 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-07-23 13:36:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:27,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,766 INFO L185 omatonBuilderFactory]: Interpolants [160#GateController_alarm, 153#true, 154#false, 155#(<= (+ GateController_time 1000) GateController_thousand), 156#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 157#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 158#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 159#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm)] [2018-07-23 13:36:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,766 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:27,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:27,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:27,767 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-23 13:36:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,791 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:36:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:36:27,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:36:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,792 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:36:27,792 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:36:27,793 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:36:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:36:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:36:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:36:27,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:36:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,797 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:36:27,797 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:36:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:27,798 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,798 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:36:27,798 INFO L414 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-07-23 13:36:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:27,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,887 INFO L185 omatonBuilderFactory]: Interpolants [208#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand)), 209#GateController_alarm, 201#true, 202#false, 203#(<= (+ GateController_time 1000) GateController_thousand), 204#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 205#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 206#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 207#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm)] [2018-07-23 13:36:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:27,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:27,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:27,891 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-23 13:36:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,916 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:36:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:36:27,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-23 13:36:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,918 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:36:27,918 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:36:27,919 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:36:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:36:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:36:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:36:27,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:36:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,923 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:36:27,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:36:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:27,925 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,925 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:36:27,925 INFO L414 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-07-23 13:36:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,019 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:36:28,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,020 INFO L185 omatonBuilderFactory]: Interpolants [256#(<= (+ GateController_time 1000) GateController_thousand), 257#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 258#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 259#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 260#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm), 261#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand)), 262#(or GateController_alarm (<= (+ GateController_time 406) GateController_thousand)), 263#GateController_alarm, 254#true, 255#false] [2018-07-23 13:36:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,020 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:36:28,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:36:28,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:36:28,022 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-23 13:36:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,044 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:36:28,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:28,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-23 13:36:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,047 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:36:28,048 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:36:28,048 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:36:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:36:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:36:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:36:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:36:28,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:36:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,059 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:36:28,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:36:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:36:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:28,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,064 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:36:28,065 INFO L414 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-07-23 13:36:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:36:28,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,163 INFO L185 omatonBuilderFactory]: Interpolants [320#(or GateController_alarm (<= (+ GateController_time 406) GateController_thousand)), 321#(or GateController_alarm (<= (+ GateController_time 307) GateController_thousand)), 322#GateController_alarm, 312#true, 313#false, 314#(<= (+ GateController_time 1000) GateController_thousand), 315#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 316#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 317#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 318#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm), 319#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand))] [2018-07-23 13:36:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:36:28,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:36:28,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:28,165 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-23 13:36:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,202 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:36:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:28,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-23 13:36:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,204 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:36:28,205 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:36:28,206 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:36:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:36:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:36:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:36:28,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:36:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,216 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:36:28,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:36:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:36:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:36:28,219 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,219 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:36:28,219 INFO L414 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-07-23 13:36:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:36:28,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,327 INFO L185 omatonBuilderFactory]: Interpolants [384#(or GateController_alarm (<= (+ GateController_time 307) GateController_thousand)), 385#(or (<= (+ GateController_time 208) GateController_thousand) GateController_alarm), 386#GateController_alarm, 375#true, 376#false, 377#(<= (+ GateController_time 1000) GateController_thousand), 378#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 379#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 380#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 381#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm), 382#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand)), 383#(or GateController_alarm (<= (+ GateController_time 406) GateController_thousand))] [2018-07-23 13:36:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,328 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:36:28,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:36:28,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:28,329 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-23 13:36:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,367 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:36:28,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:28,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-23 13:36:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,369 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:36:28,369 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:36:28,370 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:36:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:36:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:36:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:36:28,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:36:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,379 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:36:28,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:36:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:36:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:28,380 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,381 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:36:28,381 INFO L414 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-07-23 13:36:28,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:36:28,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,478 INFO L185 omatonBuilderFactory]: Interpolants [448#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 449#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm), 450#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand)), 451#(or GateController_alarm (<= (+ GateController_time 406) GateController_thousand)), 452#(or GateController_alarm (<= (+ GateController_time 307) GateController_thousand)), 453#(or (<= (+ GateController_time 208) GateController_thousand) GateController_alarm), 454#(or GateController_alarm (<= (+ GateController_time 109) GateController_thousand)), 455#GateController_alarm, 443#true, 444#false, 445#(<= (+ GateController_time 1000) GateController_thousand), 446#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 447#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand))] [2018-07-23 13:36:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,479 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:36:28,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:36:28,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:28,480 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-23 13:36:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,508 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:36:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:28,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-23 13:36:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,509 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:36:28,511 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:36:28,511 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:36:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:36:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:36:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:36:28,522 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:36:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,523 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:36:28,523 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:36:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:36:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:36:28,524 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,524 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:36:28,524 INFO L414 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-07-23 13:36:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:36:28,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,624 INFO L185 omatonBuilderFactory]: Interpolants [516#true, 517#false, 518#(<= (+ GateController_time 1000) GateController_thousand), 519#(or (<= (+ GateController_time 901) GateController_thousand) GateController_alarm), 520#(or GateController_alarm (<= (+ GateController_time 802) GateController_thousand)), 521#(or GateController_alarm (<= (+ GateController_time 703) GateController_thousand)), 522#(or (<= (+ GateController_time 604) GateController_thousand) GateController_alarm), 523#(or GateController_alarm (<= (+ GateController_time 505) GateController_thousand)), 524#(or GateController_alarm (<= (+ GateController_time 406) GateController_thousand)), 525#(or GateController_alarm (<= (+ GateController_time 307) GateController_thousand)), 526#(or (<= (+ GateController_time 208) GateController_thousand) GateController_alarm), 527#(or GateController_alarm (<= (+ GateController_time 109) GateController_thousand)), 528#(or GateController_alarm (<= (+ GateController_time 10) GateController_thousand)), 529#GateController_alarm] [2018-07-23 13:36:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,624 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:36:28,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:36:28,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:28,625 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-23 13:36:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,644 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:36:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:28,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-23 13:36:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,645 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:36:28,645 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:36:28,646 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:36:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:36:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:36:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:36:28,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:36:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:36:28,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:36:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:36:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:36:28,653 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,653 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:36:28,653 INFO L414 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-07-23 13:36:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:36:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:36:28,703 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 13:36:28,741 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:36:28 BoogieIcfgContainer [2018-07-23 13:36:28,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:36:28,743 INFO L168 Benchmark]: Toolchain (without parser) took 2036.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:36:28,745 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:36:28,746 INFO L168 Benchmark]: Boogie Preprocessor took 56.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:36:28,748 INFO L168 Benchmark]: RCFGBuilder took 291.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:36:28,749 INFO L168 Benchmark]: TraceAbstraction took 1681.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:36:28,754 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 291.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1681.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 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=99, 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=2, maxGatePosition=100, one=1, thousand=1000, time=198, 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=297, 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=396, 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=495, 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=594, 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=693, 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=792, 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=891, 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=990, 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=10] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 1.6s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 3 SDslu, 8 SDs, 0 SdLazy, 177 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/220 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 3927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-36-28-774.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-36-28-774.csv Received shutdown request...