java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:04,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:04,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:04,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:04,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:04,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:04,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:04,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:04,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:04,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:04,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:04,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:04,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:04,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:04,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:04,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:04,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:04,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:04,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:04,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:04,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:04,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:04,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:04,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:04,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:04,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:04,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:04,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:04,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:04,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:04,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:04,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:04,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:04,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:04,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:04,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:04,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:04,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:04,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:04,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:04,205 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:04,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:04,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:04,205 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:04,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:04,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:04,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:04,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:04,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:04,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:04,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-09-26 08:06:04,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-09-26 08:06:04,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:04,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:04,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:04,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:04,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,402 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:04,403 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:04,403 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:04,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:04,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:04,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:04,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:04,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:04,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,518 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-09-26 08:06:04,518 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-09-26 08:06:04,519 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-09-26 08:06:04,731 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:04,732 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04 BoogieIcfgContainer [2018-09-26 08:06:04,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:04,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:04,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:04,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:04,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/2) ... [2018-09-26 08:06:04,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbaad5c and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:04, skipping insertion in model container [2018-09-26 08:06:04,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04" (2/2) ... [2018-09-26 08:06:04,742 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-09-26 08:06:04,752 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:04,761 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:04,812 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:04,813 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:04,814 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:04,814 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:04,814 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:04,814 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:04,815 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:04,815 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:04,815 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:04,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:04,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,849 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-09-26 08:06:04,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:04,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:04,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:06:04,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:06:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:06:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:04,967 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:06:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,000 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:06:05,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:06:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,013 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:05,013 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:06:05,016 INFO L605 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-09-26 08:06:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:06:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:06:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:06:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:06:05,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:06:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,057 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:06:05,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:06:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:06:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:05,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:05,058 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-09-26 08:06:05,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:06:05,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:05,121 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:06:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,158 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:06:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:05,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,159 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:06:05,159 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:06:05,161 INFO L605 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-09-26 08:06:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:06:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:06:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:06:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,164 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:05,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:05,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,165 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:05,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-09-26 08:06:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:05,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:05,228 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:06:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,268 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:05,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:06:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,269 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:05,269 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:06:05,270 INFO L605 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-09-26 08:06:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:06:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:06:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:06:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:06:05,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:06:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,274 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:06:05,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:06:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:05,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,275 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:06:05,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-09-26 08:06:05,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:05,365 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:06:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,388 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:06:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:05,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,389 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:06:05,389 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:06:05,390 INFO L605 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-09-26 08:06:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:06:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:06:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:05,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:06:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,395 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:05,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:05,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,399 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:06:05,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-09-26 08:06:05,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:05,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:05,488 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:06:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,515 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:06:05,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:06:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,516 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:05,516 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:06:05,518 INFO L605 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-09-26 08:06:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:06:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:06:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:06:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:06:05,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:06:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,526 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:06:05,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:06:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:05,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,527 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:06:05,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-09-26 08:06:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:05,638 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:06:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,686 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:06:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:05,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:06:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,689 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:06:05,689 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:06:05,689 INFO L605 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-09-26 08:06:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:06:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:06:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:06:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:06:05,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:06:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,699 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:06:05,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:06:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:05,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,700 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:06:05,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-09-26 08:06:05,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:05,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:05,801 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:06:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,833 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:06:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:05,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:06:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,835 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:06:05,836 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:06:05,837 INFO L605 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-09-26 08:06:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:06:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:06:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:06:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:06:05,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:06:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,849 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:06:05,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:06:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:05,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,851 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:06:05,851 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-09-26 08:06:05,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:05,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:05,956 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:06:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,976 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:06:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:05,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:06:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,977 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:06:05,978 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:06:05,978 INFO L605 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-09-26 08:06:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:06:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:06:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:06:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:06:05,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:06:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,984 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:06:05,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:06:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:05,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,985 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:06:05,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-09-26 08:06:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:06,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:06,062 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:06:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,101 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:06:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:06,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:06:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,105 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:06:06,105 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:06:06,106 INFO L605 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-09-26 08:06:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:06:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:06:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:06:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:06:06,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:06:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,112 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:06:06,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:06:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:06,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,113 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:06:06,114 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-09-26 08:06:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:06,198 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:06:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,220 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:06:06,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:06,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:06:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,222 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:06:06,222 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:06:06,222 INFO L605 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-09-26 08:06:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:06:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:06:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:06:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:06:06,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:06:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,227 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:06:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:06:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:06:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:06,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,229 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:06:06,229 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-09-26 08:06:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:06:06,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:06:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:06:06,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:06,344 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:06:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,367 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:06:06,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:06,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:06:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,368 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:06:06,368 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:06:06,369 INFO L605 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-09-26 08:06:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:06:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:06:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:06:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:06:06,374 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:06:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:06:06,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:06:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:06:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:06,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,375 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:06:06,376 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-09-26 08:06:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 08:06:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 08:06:06,439 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-26 08:06:06,484 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:06:06 BoogieIcfgContainer [2018-09-26 08:06:06,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:06:06,486 INFO L168 Benchmark]: Toolchain (without parser) took 2128.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:06,489 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-09-26 08:06:06,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.69 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-09-26 08:06:06,490 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 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-09-26 08:06:06,492 INFO L168 Benchmark]: RCFGBuilder took 300.82 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-09-26 08:06:06,493 INFO L168 Benchmark]: TraceAbstraction took 1751.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:06,499 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.22 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 Procedure Inliner took 43.69 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 25.23 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 300.82 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 1751.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 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.4s 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.4s 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.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_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-06-06-519.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-06-06-519.csv Received shutdown request...