java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:32,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:32,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:32,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:32,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:32,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:32,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:32,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:32,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:32,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:32,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:32,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:32,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:32,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:32,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:32,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:32,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:32,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:32,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:32,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:32,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:32,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:32,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:32,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:32,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:32,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:32,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:32,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:32,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:32,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:32,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:32,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:32,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:32,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:32,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:32,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:32,955 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:32,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:32,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:32,978 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:32,978 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:32,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:32,982 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:32,982 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:32,982 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:32,983 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:32,983 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:32,983 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:32,984 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:32,984 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:32,984 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:32,984 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:32,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:32,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:32,985 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:32,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:32,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:32,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:32,992 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:33,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:33,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:33,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:33,048 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:33,048 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:33,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl [2018-12-03 15:07:33,049 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl' [2018-12-03 15:07:33,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:33,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:33,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:33,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:33,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,119 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:33,119 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:33,119 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:33,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:33,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:33,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:33,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:33,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:33,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:33,241 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-12-03 15:07:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-12-03 15:07:33,242 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-12-03 15:07:33,549 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:33,549 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:07:33,550 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:33 BoogieIcfgContainer [2018-12-03 15:07:33,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:33,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:33,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:33,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:33,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/2) ... [2018-12-03 15:07:33,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059ade3 and model type RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:33, skipping insertion in model container [2018-12-03 15:07:33,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:33" (2/2) ... [2018-12-03 15:07:33,559 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing-Incorrenct.bpl [2018-12-03 15:07:33,569 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:33,577 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:07:33,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:07:33,635 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:33,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:33,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:33,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:33,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:33,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:33,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:33,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 15:07:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:07:33,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:33,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:07:33,662 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:33,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-12-03 15:07:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:33,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:33,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:33,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:33,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:33,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:33,868 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 15:07:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:33,984 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-12-03 15:07:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:33,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:07:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:33,996 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:07:33,996 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:07:34,000 INFO L631 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-12-03 15:07:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:07:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:07:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:07:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-03 15:07:34,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-12-03 15:07:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,036 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-03 15:07:34,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-12-03 15:07:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:34,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-12-03 15:07:34,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:34,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,115 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-12-03 15:07:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,150 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-12-03 15:07:34,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 15:07:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,151 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:07:34,152 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:07:34,153 INFO L631 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-12-03 15:07:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:07:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:07:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:07:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 15:07:34,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-12-03 15:07:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,156 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 15:07:34,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 15:07:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:34,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,158 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-12-03 15:07:34,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:34,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:34,321 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:07:34,324 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [13], [16], [20], [22], [23] [2018-12-03 15:07:34,373 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:34,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:34,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:34,614 INFO L272 AbstractInterpreter]: Visited 8 different actions 21 times. Merged at 7 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:07:34,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:34,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:34,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:07:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:07:34,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:34,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:07:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:07:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:34,908 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-12-03 15:07:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,992 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-12-03 15:07:34,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:07:34,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-03 15:07:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,994 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:07:34,994 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:07:34,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:07:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-03 15:07:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:07:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-03 15:07:35,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-12-03 15:07:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,001 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-03 15:07:35,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:07:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-12-03 15:07:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:07:35,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,002 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 15:07:35,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-12-03 15:07:35,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 15:07:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 15:07:35,046 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 15:07:35,069 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:07:35 BoogieIcfgContainer [2018-12-03 15:07:35,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:07:35,071 INFO L168 Benchmark]: Toolchain (without parser) took 1988.94 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:07:35,073 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-12-03 15:07:35,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.68 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-12-03 15:07:35,074 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 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-12-03 15:07:35,075 INFO L168 Benchmark]: RCFGBuilder took 401.89 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:07:35,076 INFO L168 Benchmark]: TraceAbstraction took 1518.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:07:35,082 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.16 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 38.68 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.36 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 401.89 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1518.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: assertion can be violated assertion can be violated We found a FailurePath: [L16] gate := 0; [L17] time := 0; [L19] one := 1; [L20] hundred := 100 * one; [L21] thousand := 1000 * one; [L22] alarmTrain := false; VAL [alarmTrain=false, gate=0, hundred=100, one=1, thousand=1000, time=0] [L25] COND TRUE time < thousand VAL [alarmTrain=false, gate=0, hundred=100, one=1, thousand=1000, time=0] [L27] COND FALSE !(gateMotorFailure) VAL [alarmTrain=false, gate=0, gateMotorFailure=false, hundred=100, one=1, thousand=1000, time=0] [L30] COND TRUE gate < hundred [L31] gate := gate + 1; VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, one=1, thousand=1000, time=0] [L34] havoc increment; [L35] assume increment < 1000; [L36] time := time + increment; VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L25] COND TRUE time < thousand VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L27] COND FALSE !(gateMotorFailure) VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L30] COND TRUE gate < hundred [L31] gate := gate + 1; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L34] havoc increment; [L35] assume increment < 1000; [L36] time := time + increment; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] [L25] COND FALSE !(time < thousand) VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] [L39] assert alarmTrain || gate == hundred; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 42 SDslu, 29 SDs, 0 SdLazy, 15 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 29 ConstructedInterpolants, 6 QuantifiedInterpolants, 1077 SizeOfPredicates, 4 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...