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-9f4048f [2018-10-04 12:13:44,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:44,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:44,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:44,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:44,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:44,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:44,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:44,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:44,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:44,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:44,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:44,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:44,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:44,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:44,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:44,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:44,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:44,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:44,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:44,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:44,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:44,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:44,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:44,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:44,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:44,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:44,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:44,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:44,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:44,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:44,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:44,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:44,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:44,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:44,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:44,115 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 12:13:44,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:44,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:44,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:44,130 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:44,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:44,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:44,131 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:44,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:44,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:44,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:44,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:44,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:44,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:44,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:44,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:44,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:44,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:44,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:44,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:44,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:44,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:44,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:44,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:44,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:44,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:44,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:44,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:44,136 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:44,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:44,136 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:44,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:44,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:44,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:44,199 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:44,199 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:44,200 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 12:13:44,200 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl' [2018-10-04 12:13:44,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:44,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:44,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:44,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:44,271 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,284 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,289 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:44,290 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:44,290 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:44,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:44,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:44,306 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,306 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,307 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,307 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,310 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,315 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,316 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 12:13:44" (1/1) ... [2018-10-04 12:13:44,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:44,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:44,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:44,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (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 12:13:44,400 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 12:13:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 12:13:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 12:13:44,693 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:44,694 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:44 BoogieIcfgContainer [2018-10-04 12:13:44,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:44,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:44,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:44,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:44,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/2) ... [2018-10-04 12:13:44,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ade0f5 and model type RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:44, skipping insertion in model container [2018-10-04 12:13:44,701 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 12:13:44" (2/2) ... [2018-10-04 12:13:44,703 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing-Incorrenct.bpl [2018-10-04 12:13:44,713 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:44,722 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:13:44,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:44,779 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:44,779 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:44,779 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:44,779 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:44,780 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:44,780 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:44,780 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:44,780 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 12:13:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:13:44,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:44,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:13:44,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:44,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-10-04 12:13:44,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:44,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:44,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,053 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 12:13:45,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:45,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,106 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 12:13:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,198 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:13:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:13:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,213 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:13:45,213 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:13:45,216 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 12:13:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:13:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 12:13:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:13:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-10-04 12:13:45,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-10-04 12:13:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,265 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-10-04 12:13:45,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-04 12:13:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:13:45,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:45,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-10-04 12:13:45,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,305 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 12:13:45,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,312 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-10-04 12:13:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,337 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-04 12:13:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-04 12:13:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,338 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:13:45,339 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:13:45,340 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 12:13:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:13:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:13:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:13:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 12:13:45,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-10-04 12:13:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,343 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 12:13:45,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 12:13:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:13:45,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:45,344 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-10-04 12:13:45,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,400 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 12:13:45,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:45,401 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 12:13:45,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:45,649 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 12:13:45,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:45,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 12:13:45,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:13:45,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:13:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:13:45,675 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-10-04 12:13:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,718 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-04 12:13:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:13:45,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-04 12:13:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,721 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:13:45,722 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:13:45,722 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 12:13:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:13:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 12:13:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:13:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 12:13:45,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 12:13:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,731 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 12:13:45,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:13:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 12:13:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:13:45,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,734 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 12:13:45,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-10-04 12:13:45,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:13:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:13:45,779 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 12:13:45,804 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:13:45 BoogieIcfgContainer [2018-10-04 12:13:45,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:13:45,805 INFO L168 Benchmark]: Toolchain (without parser) took 1556.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-10-04 12:13:45,807 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:13:45,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:13:45,809 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:13:45,809 INFO L168 Benchmark]: RCFGBuilder took 375.76 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:13:45,810 INFO L168 Benchmark]: TraceAbstraction took 1109.75 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 12:13:45,815 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 375.76 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1109.75 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, 1.0s 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.4s 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_12-13-45-840.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_12-13-45-840.csv Received shutdown request...