java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:07:55,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:07:55,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:07:55,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:07:55,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:07:55,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:07:55,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:07:55,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:07:55,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:07:55,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:07:55,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:07:55,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:07:55,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:07:55,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:07:55,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:07:55,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:07:55,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:07:55,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:07:55,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:07:55,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:07:55,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:07:55,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:07:55,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:07:55,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:07:55,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:07:55,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:07:55,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:07:55,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:07:55,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:07:55,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:07:55,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:07:55,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:07:55,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:07:55,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:07:55,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:07:55,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:07:55,553 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:07:55,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:07:55,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:07:55,582 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:07:55,583 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:07:55,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:07:55,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:07:55,584 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:07:55,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:07:55,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:07:55,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:07:55,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:07:55,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:07:55,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:07:55,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:07:55,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:07:55,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:07:55,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:07:55,587 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:07:55,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:07:55,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:07:55,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:07:55,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:07:55,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:07:55,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:07:55,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:07:55,590 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:07:55,590 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:07:55,590 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:07:55,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:07:55,591 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:07:55,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:07:55,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:07:55,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:07:55,670 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:07:55,671 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:07:55,672 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-10-04 09:07:55,672 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl' [2018-10-04 09:07:55,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:07:55,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:07:55,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:07:55,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:07:55,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:07:55,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,766 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:07:55,767 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:07:55,767 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:07:55,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:07:55,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:07:55,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:07:55,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:07:55,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:07:55,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:07:55,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:07:55,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:07:55,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (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-10-04 09:07:55,880 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 09:07:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 09:07:55,881 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 09:07:56,123 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:07:56,124 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:07:56 BoogieIcfgContainer [2018-10-04 09:07:56,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:07:56,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:07:56,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:07:56,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:07:56,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/2) ... [2018-10-04 09:07:56,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7422aad7 and model type RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:07:56, skipping insertion in model container [2018-10-04 09:07:56,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:07:56" (2/2) ... [2018-10-04 09:07:56,137 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing-Incorrenct.bpl [2018-10-04 09:07:56,149 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:07:56,157 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:07:56,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:07:56,219 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:07:56,219 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:07:56,219 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:07:56,220 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:07:56,220 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:07:56,220 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:07:56,220 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:07:56,220 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:07:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 09:07:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:07:56,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:56,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:07:56,245 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-10-04 09:07:56,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:07:56,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:56,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:07:56,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:56,437 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 09:07:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:56,534 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 09:07:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:56,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:07:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:56,548 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:07:56,548 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:07:56,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:07:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 09:07:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:07:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-10-04 09:07:56,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-10-04 09:07:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:56,606 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-10-04 09:07:56,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-04 09:07:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:07:56,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:56,607 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:07:56,607 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-10-04 09:07:56,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:07:56,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:56,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:07:56,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:56,649 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-10-04 09:07:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:56,681 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-04 09:07:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:56,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-04 09:07:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:56,682 INFO L225 Difference]: With dead ends: 16 [2018-10-04 09:07:56,682 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:07:56,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:07:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:07:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:07:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 09:07:56,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-10-04 09:07:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:56,687 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 09:07:56,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 09:07:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:07:56,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:56,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:07:56,688 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:56,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-10-04 09:07:56,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:07:56,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:07:56,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-04 09:07:56,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:56,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:07:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:07:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:07:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 09:07:57,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:07:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:07:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:07:57,017 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-10-04 09:07:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:57,104 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-04 09:07:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:07:57,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-04 09:07:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:57,107 INFO L225 Difference]: With dead ends: 20 [2018-10-04 09:07:57,108 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:07:57,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:07:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:07:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 09:07:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:07:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 09:07:57,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 09:07:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:57,113 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 09:07:57,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:07:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 09:07:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:07:57,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:57,115 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 09:07:57,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:57,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-10-04 09:07:57,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:07:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:07:57,170 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 09:07:57,194 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:07:57 BoogieIcfgContainer [2018-10-04 09:07:57,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:07:57,196 INFO L168 Benchmark]: Toolchain (without parser) took 1472.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: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:07:57,199 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:07:57,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.61 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-10-04 09:07:57,200 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 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-10-04 09:07:57,201 INFO L168 Benchmark]: RCFGBuilder took 329.26 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-10-04 09:07:57,203 INFO L168 Benchmark]: TraceAbstraction took 1069.88 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:07:57,209 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.61 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 24.03 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 329.26 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 1069.88 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: 44.9 MB). Peak memory consumption was 44.9 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, 0.9s 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, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s 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.0s AbstIntTime, 0 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.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 22 ConstructedInterpolants, 6 QuantifiedInterpolants, 860 SizeOfPredicates, 4 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 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/RailwayCrossing-Incorrenct.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-07-57-238.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing-Incorrenct.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-07-57-238.csv Received shutdown request...