java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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-e6fd87c [2018-07-25 08:36:02,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:36:02,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:36:02,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:36:02,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:36:02,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:36:02,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:36:02,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:36:02,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:36:02,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:36:02,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:36:02,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:36:02,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:36:02,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:36:02,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:36:02,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:36:02,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:36:02,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:36:02,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:36:02,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:36:02,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:36:02,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:36:02,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:36:02,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:36:02,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:36:02,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:36:02,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:36:02,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:36:02,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:36:02,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:36:02,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:36:02,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:36:02,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:36:02,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:36:02,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:36:02,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:36:02,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:36:02,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:36:02,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:36:02,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:36:02,716 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:36:02,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:36:02,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:36:02,717 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:36:02,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:36:02,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:36:02,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:36:02,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:36:02,820 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:36:02,820 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:36:02,821 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-25 08:36:02,822 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-07-25 08:36:02,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:36:02,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:36:02,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:02,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:36:02,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:36:02,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,912 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:36:02,912 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:36:02,913 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:36:02,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:02,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:36:02,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:36:02,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:36:02,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:02,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:36:02,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:36:02,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:36:02,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:36:02,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/1) ... [2018-07-25 08:36:03,029 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-07-25 08:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-07-25 08:36:03,030 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-07-25 08:36:03,271 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:36:03,272 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:03 BoogieIcfgContainer [2018-07-25 08:36:03,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:36:03,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:36:03,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:36:03,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:36:03,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:02" (1/2) ... [2018-07-25 08:36:03,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c076c4 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:36:03, skipping insertion in model container [2018-07-25 08:36:03,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:03" (2/2) ... [2018-07-25 08:36:03,288 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-07-25 08:36:03,300 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:36:03,312 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:36:03,369 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:36:03,370 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:36:03,370 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:36:03,370 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:36:03,371 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:36:03,371 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:36:03,371 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:36:03,371 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:36:03,372 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:36:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 08:36:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:36:03,407 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:03,408 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:36:03,409 INFO L415 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-07-25 08:36:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:03,486 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-25 08:36:03,491 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:03,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:36:03,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:36:03,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:36:03,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:36:03,535 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 08:36:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:03,575 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:36:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:36:03,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:36:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:03,589 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:36:03,589 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:36:03,596 INFO L574 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-25 08:36:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:36:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:36:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:36:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:36:03,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:36:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:03,642 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:36:03,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:36:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:36:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:36:03,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:03,643 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:36:03,644 INFO L415 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-07-25 08:36:03,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:03,683 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-25 08:36:03,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:03,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:36:03,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:03,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:03,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:03,691 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 08:36:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:03,744 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:36:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:36:03,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:36:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:03,746 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:36:03,746 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:36:03,747 INFO L574 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-25 08:36:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:36:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:36:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:36:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:36:03,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:36:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:03,750 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:36:03,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:36:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:36:03,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:03,751 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:36:03,752 INFO L415 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-07-25 08:36:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:03,810 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-25 08:36:03,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:03,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:36:03,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:03,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:03,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:03,812 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 08:36:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:03,851 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:36:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:36:03,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:36:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:03,853 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:36:03,854 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:36:03,855 INFO L574 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-25 08:36:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:36:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:36:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:36:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:36:03,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:36:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:03,861 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:36:03,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:36:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:03,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:03,862 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:36:03,862 INFO L415 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-07-25 08:36:03,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:03,964 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-25 08:36:03,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:03,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:36:03,965 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:03,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:03,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:03,966 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 08:36:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:03,987 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:36:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:36:03,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 08:36:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:03,988 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:36:03,988 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:36:03,991 INFO L574 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-25 08:36:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:36:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:36:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:36:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:36:03,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:36:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:03,996 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:36:03,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:36:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:36:03,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:03,997 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:36:03,997 INFO L415 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-07-25 08:36:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,077 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-25 08:36:04,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:04,078 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:04,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:04,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:04,079 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 08:36:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,099 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:36:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:36:04,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 08:36:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,100 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:36:04,100 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:36:04,101 INFO L574 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-25 08:36:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:36:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:36:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:36:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:36:04,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:36:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,105 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:36:04,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:36:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:04,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,106 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:36:04,106 INFO L415 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-07-25 08:36:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,162 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-25 08:36:04,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:04,163 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:04,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:04,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:04,164 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 08:36:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,184 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:36:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:04,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 08:36:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,185 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:36:04,185 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:36:04,186 INFO L574 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-25 08:36:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:36:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:36:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:36:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:36:04,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:36:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,191 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:36:04,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:36:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:04,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,192 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:36:04,192 INFO L415 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-07-25 08:36:04,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,290 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-25 08:36:04,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:04,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:04,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:04,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:04,294 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 08:36:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,332 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:36:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:04,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 08:36:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,333 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:36:04,333 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:36:04,334 INFO L574 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-25 08:36:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:36:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:36:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:36:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:36:04,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:36:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,339 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:36:04,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:36:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:04,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,340 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:36:04,341 INFO L415 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-07-25 08:36:04,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,400 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-25 08:36:04,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:04,401 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:04,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:04,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:04,402 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 08:36:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,421 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:36:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:04,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 08:36:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,422 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:36:04,422 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:36:04,423 INFO L574 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-25 08:36:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:36:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:36:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:36:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:36:04,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:36:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,427 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:36:04,428 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:36:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:04,428 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,428 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:36:04,429 INFO L415 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-07-25 08:36:04,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,526 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-25 08:36:04,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:04,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:04,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:04,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:04,528 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 08:36:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,548 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:36:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:04,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 08:36:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,549 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:36:04,550 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:36:04,550 INFO L574 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-25 08:36:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:36:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:36:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:36:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:36:04,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:36:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,559 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:36:04,559 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:36:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:04,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,560 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:36:04,562 INFO L415 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-07-25 08:36:04,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,651 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-25 08:36:04,651 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:04,652 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:36:04,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:36:04,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:04,653 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 08:36:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,697 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:36:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:04,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 08:36:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,701 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:36:04,701 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:36:04,702 INFO L574 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-25 08:36:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:36:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:36:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:36:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:36:04,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:36:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,711 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:36:04,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:36:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:36:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:04,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,712 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:36:04,712 INFO L415 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-07-25 08:36:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:04,830 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-25 08:36:04,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:04,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:36:04,831 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:36:04,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:36:04,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:04,833 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 08:36:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:04,865 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:36:04,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:04,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 08:36:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:04,866 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:36:04,867 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:36:04,868 INFO L574 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-25 08:36:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:36:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:36:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:36:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:36:04,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:36:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:04,880 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:36:04,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:36:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:36:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:36:04,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:04,881 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:36:04,882 INFO L415 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-07-25 08:36:04,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:36:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:36:04,951 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 08:36:04,998 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:36:04 BoogieIcfgContainer [2018-07-25 08:36:04,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:36:04,999 INFO L168 Benchmark]: Toolchain (without parser) took 2126.51 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-07-25 08:36:05,002 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-25 08:36:05,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 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-25 08:36:05,006 INFO L168 Benchmark]: Boogie Preprocessor took 22.91 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-25 08:36:05,006 INFO L168 Benchmark]: RCFGBuilder took 333.84 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-25 08:36:05,009 INFO L168 Benchmark]: TraceAbstraction took 1721.46 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-07-25 08:36:05,017 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.24 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 40.44 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 22.91 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 333.84 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 1721.46 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.3s 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.6s 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-07-25_08-36-05-037.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-36-05-037.csv Received shutdown request...