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/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:30:51,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:30:51,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:30:51,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:30:51,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:30:51,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:30:51,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:30:51,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:30:51,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:30:51,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:30:51,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:30:51,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:30:51,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:30:51,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:30:51,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:30:51,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:30:51,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:30:51,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:30:51,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:30:51,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:30:51,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:30:51,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:30:51,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:30:51,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:30:51,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:30:51,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:30:51,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:30:51,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:30:51,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:30:51,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:30:51,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:30:51,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:30:51,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:30:51,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:30:51,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:30:51,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:30:51,230 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-09-23 19:30:51,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:30:51,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:30:51,263 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:30:51,264 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:30:51,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:30:51,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:30:51,265 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:30:51,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:30:51,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:30:51,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:30:51,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:30:51,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:30:51,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:30:51,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:30:51,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:30:51,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:30:51,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:30:51,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:30:51,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:30:51,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:30:51,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:30:51,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:30:51,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:30:51,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:30:51,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:30:51,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:30:51,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:30:51,272 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:30:51,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:30:51,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:30:51,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:30:51,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:30:51,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:30:51,381 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:30:51,382 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:30:51,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-09-23 19:30:51,383 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-09-23 19:30:51,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:30:51,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:30:51,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:51,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:30:51,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:30:51,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,516 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:30:51,517 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:30:51,517 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:30:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:51,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:30:51,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:30:51,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:30:51,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/1) ... [2018-09-23 19:30:51,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:30:51,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:30:51,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:30:51,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:30:51,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (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-09-23 19:30:51,640 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-23 19:30:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-23 19:30:51,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-23 19:30:52,450 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:30:52,450 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:30:52 BoogieIcfgContainer [2018-09-23 19:30:52,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:30:52,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:30:52,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:30:52,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:30:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:51" (1/2) ... [2018-09-23 19:30:52,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb10b05 and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:30:52, skipping insertion in model container [2018-09-23 19:30:52,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:30:52" (2/2) ... [2018-09-23 19:30:52,459 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-09-23 19:30:52,470 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:30:52,479 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:30:52,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:30:52,535 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:30:52,535 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:30:52,536 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:30:52,536 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:30:52,536 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:30:52,536 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:30:52,536 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:30:52,537 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:30:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-09-23 19:30:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:30:52,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:52,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:30:52,564 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:52,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-09-23 19:30:52,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:52,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:52,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:52,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:52,812 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:52,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:30:52,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:52,831 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-09-23 19:30:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:52,906 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-09-23 19:30:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:52,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-09-23 19:30:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:52,926 INFO L225 Difference]: With dead ends: 92 [2018-09-23 19:30:52,926 INFO L226 Difference]: Without dead ends: 58 [2018-09-23 19:30:52,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-23 19:30:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-23 19:30:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-23 19:30:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-09-23 19:30:52,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-09-23 19:30:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:52,974 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-09-23 19:30:52,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-09-23 19:30:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:30:52,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:52,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:30:52,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:52,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-09-23 19:30:52,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:52,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:52,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:53,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-09-23 19:30:53,053 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:53,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-23 19:30:53,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:53,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:53,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:53,056 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-09-23 19:30:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:53,182 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-09-23 19:30:53,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:53,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-09-23 19:30:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:53,184 INFO L225 Difference]: With dead ends: 64 [2018-09-23 19:30:53,184 INFO L226 Difference]: Without dead ends: 63 [2018-09-23 19:30:53,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-23 19:30:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-23 19:30:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-23 19:30:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-09-23 19:30:53,197 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-09-23 19:30:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:53,197 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-09-23 19:30:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-09-23 19:30:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:30:53,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:53,199 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:53,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:53,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-09-23 19:30:53,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:53,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:53,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-23 19:30:53,378 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:53,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:30:53,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:30:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:30:53,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:30:53,380 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-09-23 19:30:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:53,636 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-09-23 19:30:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:30:53,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-23 19:30:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:53,640 INFO L225 Difference]: With dead ends: 95 [2018-09-23 19:30:53,640 INFO L226 Difference]: Without dead ends: 94 [2018-09-23 19:30:53,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:30:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-23 19:30:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-09-23 19:30:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-23 19:30:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-09-23 19:30:53,655 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-09-23 19:30:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:53,656 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-09-23 19:30:53,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:30:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-09-23 19:30:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:30:53,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:53,658 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:53,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:53,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-09-23 19:30:53,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:53,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:53,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:30:53,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:53,724 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-09-23 19:30:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:53,872 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-09-23 19:30:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:53,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-09-23 19:30:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:53,875 INFO L225 Difference]: With dead ends: 205 [2018-09-23 19:30:53,875 INFO L226 Difference]: Without dead ends: 116 [2018-09-23 19:30:53,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-23 19:30:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-09-23 19:30:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-23 19:30:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-09-23 19:30:53,889 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-09-23 19:30:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:53,889 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-09-23 19:30:53,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-09-23 19:30:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-23 19:30:53,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:53,891 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:53,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:53,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-09-23 19:30:53,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:54,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:54,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:30:54,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:30:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:30:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:30:54,029 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-09-23 19:30:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:54,150 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-09-23 19:30:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:30:54,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-09-23 19:30:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:54,155 INFO L225 Difference]: With dead ends: 297 [2018-09-23 19:30:54,155 INFO L226 Difference]: Without dead ends: 186 [2018-09-23 19:30:54,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:30:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-23 19:30:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-23 19:30:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-23 19:30:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-09-23 19:30:54,177 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-09-23 19:30:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:54,178 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-09-23 19:30:54,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:30:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-09-23 19:30:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-23 19:30:54,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:54,181 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:54,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:54,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-09-23 19:30:54,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:54,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-23 19:30:54,253 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:54,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:30:54,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:54,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:54,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:54,255 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-09-23 19:30:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:54,415 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-09-23 19:30:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:54,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-09-23 19:30:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:54,420 INFO L225 Difference]: With dead ends: 472 [2018-09-23 19:30:54,421 INFO L226 Difference]: Without dead ends: 283 [2018-09-23 19:30:54,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-23 19:30:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-09-23 19:30:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-23 19:30:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-09-23 19:30:54,442 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-09-23 19:30:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:54,442 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-09-23 19:30:54,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-09-23 19:30:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-23 19:30:54,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:54,445 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:54,445 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:54,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-09-23 19:30:54,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:54,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-23 19:30:54,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:54,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:30:54,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:54,532 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-09-23 19:30:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:54,647 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-09-23 19:30:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:54,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-23 19:30:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:54,653 INFO L225 Difference]: With dead ends: 480 [2018-09-23 19:30:54,653 INFO L226 Difference]: Without dead ends: 289 [2018-09-23 19:30:54,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-23 19:30:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-09-23 19:30:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-23 19:30:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-09-23 19:30:54,669 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-09-23 19:30:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:54,670 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-09-23 19:30:54,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-09-23 19:30:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-23 19:30:54,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:54,672 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:54,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:54,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-09-23 19:30:54,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:54,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:54,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:54,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-23 19:30:54,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:54,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:30:54,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:54,727 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-09-23 19:30:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:55,045 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-09-23 19:30:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:55,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-09-23 19:30:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:55,047 INFO L225 Difference]: With dead ends: 378 [2018-09-23 19:30:55,048 INFO L226 Difference]: Without dead ends: 181 [2018-09-23 19:30:55,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-23 19:30:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-09-23 19:30:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-23 19:30:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-09-23 19:30:55,059 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-09-23 19:30:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:55,060 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-09-23 19:30:55,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-09-23 19:30:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-23 19:30:55,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:55,062 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:55,063 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:55,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-09-23 19:30:55,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:55,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:55,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:55,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-23 19:30:55,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:30:55,336 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-09-23 19:30:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:55,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:30:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-23 19:30:55,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 19:30:55,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2018-09-23 19:30:55,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:30:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:30:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:30:55,615 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 9 states. [2018-09-23 19:30:56,062 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-23 19:30:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:56,572 INFO L93 Difference]: Finished difference Result 588 states and 937 transitions. [2018-09-23 19:30:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:30:56,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-09-23 19:30:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:56,577 INFO L225 Difference]: With dead ends: 588 [2018-09-23 19:30:56,577 INFO L226 Difference]: Without dead ends: 408 [2018-09-23 19:30:56,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:30:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-09-23 19:30:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 315. [2018-09-23 19:30:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-23 19:30:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-09-23 19:30:56,596 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-09-23 19:30:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:56,596 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-09-23 19:30:56,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:30:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-09-23 19:30:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-23 19:30:56,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:56,599 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:56,599 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:56,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 928707300, now seen corresponding path program 1 times [2018-09-23 19:30:56,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:56,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-23 19:30:56,660 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:56,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:30:56,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:56,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:56,661 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-09-23 19:30:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:56,722 INFO L93 Difference]: Finished difference Result 797 states and 1238 transitions. [2018-09-23 19:30:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:56,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-09-23 19:30:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:56,730 INFO L225 Difference]: With dead ends: 797 [2018-09-23 19:30:56,730 INFO L226 Difference]: Without dead ends: 459 [2018-09-23 19:30:56,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-23 19:30:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-09-23 19:30:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-23 19:30:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 678 transitions. [2018-09-23 19:30:56,754 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 678 transitions. Word has length 57 [2018-09-23 19:30:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:56,755 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 678 transitions. [2018-09-23 19:30:56,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 678 transitions. [2018-09-23 19:30:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-23 19:30:56,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:56,757 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:56,758 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:56,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash -139266043, now seen corresponding path program 1 times [2018-09-23 19:30:56,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-23 19:30:56,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:56,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:30:56,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:30:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:30:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:56,842 INFO L87 Difference]: Start difference. First operand 455 states and 678 transitions. Second operand 3 states. [2018-09-23 19:30:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:57,067 INFO L93 Difference]: Finished difference Result 909 states and 1355 transitions. [2018-09-23 19:30:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:30:57,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-09-23 19:30:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:57,070 INFO L225 Difference]: With dead ends: 909 [2018-09-23 19:30:57,070 INFO L226 Difference]: Without dead ends: 455 [2018-09-23 19:30:57,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:30:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-09-23 19:30:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-09-23 19:30:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-23 19:30:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 658 transitions. [2018-09-23 19:30:57,093 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 658 transitions. Word has length 57 [2018-09-23 19:30:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:57,093 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 658 transitions. [2018-09-23 19:30:57,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:30:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 658 transitions. [2018-09-23 19:30:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-23 19:30:57,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:57,095 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:30:57,096 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:57,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-09-23 19:30:57,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:57,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:57,817 WARN L178 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-09-23 19:30:58,372 WARN L178 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-09-23 19:30:58,643 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:30:58,929 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:30:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:59,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:30:59,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:30:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:59,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:00,240 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-09-23 19:31:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:00,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:00,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-23 19:31:00,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:31:00,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:31:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:00,435 INFO L87 Difference]: Start difference. First operand 455 states and 658 transitions. Second operand 16 states. [2018-09-23 19:31:00,978 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:31:01,585 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-23 19:31:02,085 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-23 19:31:02,467 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-09-23 19:31:03,991 WARN L178 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-23 19:31:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:04,184 INFO L93 Difference]: Finished difference Result 1533 states and 2192 transitions. [2018-09-23 19:31:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:04,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-09-23 19:31:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:04,192 INFO L225 Difference]: With dead ends: 1533 [2018-09-23 19:31:04,192 INFO L226 Difference]: Without dead ends: 1532 [2018-09-23 19:31:04,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-09-23 19:31:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-09-23 19:31:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 767. [2018-09-23 19:31:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-09-23 19:31:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2018-09-23 19:31:04,231 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 59 [2018-09-23 19:31:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:04,231 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2018-09-23 19:31:04,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:31:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2018-09-23 19:31:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 19:31:04,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:04,233 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:04,234 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:04,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1550465213, now seen corresponding path program 1 times [2018-09-23 19:31:04,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:04,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-23 19:31:04,319 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:04,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:04,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:31:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:31:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:04,320 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand 3 states. [2018-09-23 19:31:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:04,489 INFO L93 Difference]: Finished difference Result 1835 states and 2691 transitions. [2018-09-23 19:31:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:31:04,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-09-23 19:31:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:04,496 INFO L225 Difference]: With dead ends: 1835 [2018-09-23 19:31:04,496 INFO L226 Difference]: Without dead ends: 1069 [2018-09-23 19:31:04,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-09-23 19:31:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1018. [2018-09-23 19:31:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-09-23 19:31:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1471 transitions. [2018-09-23 19:31:04,545 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1471 transitions. Word has length 80 [2018-09-23 19:31:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:04,546 INFO L480 AbstractCegarLoop]: Abstraction has 1018 states and 1471 transitions. [2018-09-23 19:31:04,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:31:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1471 transitions. [2018-09-23 19:31:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-23 19:31:04,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:04,549 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:04,550 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:04,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-09-23 19:31:04,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:04,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:04,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 19:31:04,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:04,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:31:04,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:31:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:31:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:31:04,706 INFO L87 Difference]: Start difference. First operand 1018 states and 1471 transitions. Second operand 4 states. [2018-09-23 19:31:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:04,885 INFO L93 Difference]: Finished difference Result 2065 states and 2971 transitions. [2018-09-23 19:31:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:31:04,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-09-23 19:31:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:04,890 INFO L225 Difference]: With dead ends: 2065 [2018-09-23 19:31:04,891 INFO L226 Difference]: Without dead ends: 1018 [2018-09-23 19:31:04,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:31:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-09-23 19:31:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2018-09-23 19:31:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-09-23 19:31:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1414 transitions. [2018-09-23 19:31:04,933 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1414 transitions. Word has length 81 [2018-09-23 19:31:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:04,933 INFO L480 AbstractCegarLoop]: Abstraction has 1016 states and 1414 transitions. [2018-09-23 19:31:04,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:31:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1414 transitions. [2018-09-23 19:31:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-23 19:31:04,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:04,936 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:04,936 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:04,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 571414056, now seen corresponding path program 1 times [2018-09-23 19:31:04,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:04,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:04,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-23 19:31:05,016 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:05,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:05,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:31:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:31:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:05,017 INFO L87 Difference]: Start difference. First operand 1016 states and 1414 transitions. Second operand 3 states. [2018-09-23 19:31:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:05,183 INFO L93 Difference]: Finished difference Result 1868 states and 2575 transitions. [2018-09-23 19:31:05,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:31:05,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-23 19:31:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:05,188 INFO L225 Difference]: With dead ends: 1868 [2018-09-23 19:31:05,188 INFO L226 Difference]: Without dead ends: 736 [2018-09-23 19:31:05,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-09-23 19:31:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 726. [2018-09-23 19:31:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-09-23 19:31:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 948 transitions. [2018-09-23 19:31:05,221 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 948 transitions. Word has length 97 [2018-09-23 19:31:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:05,221 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 948 transitions. [2018-09-23 19:31:05,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:31:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 948 transitions. [2018-09-23 19:31:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-23 19:31:05,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:05,223 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:05,224 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:05,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-09-23 19:31:05,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:05,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:05,586 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-09-23 19:31:06,028 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-23 19:31:06,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:06,242 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:31:06,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:06,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 75 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:07,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:07,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-23 19:31:07,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 19:31:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 19:31:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:31:07,429 INFO L87 Difference]: Start difference. First operand 726 states and 948 transitions. Second operand 26 states. [2018-09-23 19:31:07,819 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-09-23 19:31:08,997 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-09-23 19:31:09,233 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-09-23 19:31:09,550 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-09-23 19:31:09,853 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-09-23 19:31:10,207 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-09-23 19:31:10,499 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-09-23 19:31:10,649 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-09-23 19:31:11,040 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-09-23 19:31:11,335 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-09-23 19:31:11,591 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-09-23 19:31:11,792 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-09-23 19:31:12,077 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-09-23 19:31:12,318 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-09-23 19:31:12,808 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-09-23 19:31:13,322 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-09-23 19:31:13,542 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-09-23 19:31:13,709 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-09-23 19:31:13,991 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-09-23 19:31:14,652 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-09-23 19:31:14,916 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-09-23 19:31:15,104 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-09-23 19:31:15,559 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-09-23 19:31:15,793 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-09-23 19:31:15,982 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-09-23 19:31:16,819 WARN L178 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-09-23 19:31:17,177 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-09-23 19:31:17,368 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-09-23 19:31:18,084 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-09-23 19:31:18,269 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-09-23 19:31:18,405 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-09-23 19:31:18,666 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-09-23 19:31:18,905 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-09-23 19:31:19,082 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-09-23 19:31:19,280 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-09-23 19:31:19,756 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-09-23 19:31:19,980 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-09-23 19:31:20,187 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-09-23 19:31:20,409 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-09-23 19:31:20,783 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-09-23 19:31:21,021 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-09-23 19:31:21,302 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-09-23 19:31:21,812 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-09-23 19:31:22,097 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-09-23 19:31:22,327 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-09-23 19:31:22,687 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-09-23 19:31:22,862 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-09-23 19:31:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:22,959 INFO L93 Difference]: Finished difference Result 6073 states and 7615 transitions. [2018-09-23 19:31:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-23 19:31:22,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-09-23 19:31:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:22,981 INFO L225 Difference]: With dead ends: 6073 [2018-09-23 19:31:22,982 INFO L226 Difference]: Without dead ends: 6072 [2018-09-23 19:31:22,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2220, Invalid=9552, Unknown=0, NotChecked=0, Total=11772 [2018-09-23 19:31:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2018-09-23 19:31:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 1176. [2018-09-23 19:31:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-09-23 19:31:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1565 transitions. [2018-09-23 19:31:23,090 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1565 transitions. Word has length 99 [2018-09-23 19:31:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,091 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1565 transitions. [2018-09-23 19:31:23,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 19:31:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1565 transitions. [2018-09-23 19:31:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-23 19:31:23,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:23,093 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:23,094 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:23,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1497402593, now seen corresponding path program 1 times [2018-09-23 19:31:23,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-23 19:31:23,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:23,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:23,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:31:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:31:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:23,180 INFO L87 Difference]: Start difference. First operand 1176 states and 1565 transitions. Second operand 3 states. [2018-09-23 19:31:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:23,349 INFO L93 Difference]: Finished difference Result 2107 states and 2774 transitions. [2018-09-23 19:31:23,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:31:23,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-09-23 19:31:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:23,353 INFO L225 Difference]: With dead ends: 2107 [2018-09-23 19:31:23,353 INFO L226 Difference]: Without dead ends: 887 [2018-09-23 19:31:23,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-09-23 19:31:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 691. [2018-09-23 19:31:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-09-23 19:31:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 882 transitions. [2018-09-23 19:31:23,397 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 882 transitions. Word has length 99 [2018-09-23 19:31:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,398 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 882 transitions. [2018-09-23 19:31:23,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:31:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 882 transitions. [2018-09-23 19:31:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-23 19:31:23,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:23,400 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:23,400 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:23,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-09-23 19:31:23,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-09-23 19:31:23,461 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:23,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:23,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:31:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:31:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:23,462 INFO L87 Difference]: Start difference. First operand 691 states and 882 transitions. Second operand 3 states. [2018-09-23 19:31:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:23,512 INFO L93 Difference]: Finished difference Result 1137 states and 1433 transitions. [2018-09-23 19:31:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:31:23,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-09-23 19:31:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:23,512 INFO L225 Difference]: With dead ends: 1137 [2018-09-23 19:31:23,512 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 19:31:23,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:31:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 19:31:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 19:31:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 19:31:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 19:31:23,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-09-23 19:31:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,515 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 19:31:23,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:31:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 19:31:23,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 19:31:23,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 19:31:23,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:24,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:24,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:24,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:24,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:24,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:31:25,839 WARN L178 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 502 DAG size of output: 432 [2018-09-23 19:31:32,403 WARN L178 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 414 DAG size of output: 142 [2018-09-23 19:31:32,408 INFO L426 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-09-23 19:31:32,409 INFO L426 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-09-23 19:31:32,410 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-09-23 19:31:32,411 INFO L422 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse16 (<= Elevator_current Elevator_max)) (.cse40 (+ Elevator_current 1))) (let ((.cse9 (and .cse16 (< Elevator_min .cse40) (<= Elevator_qDC1 1))) (.cse14 (= Elevator_qCSP 1)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal))) (let ((.cse6 (<= Elevator_min |Elevator_current'|)) (.cse31 (= |Elevator_dir'| 1)) (.cse35 (+ |Elevator_dir'| 1)) (.cse37 (+ Elevator_dir Elevator_goal)) (.cse38 (+ Elevator_min 1)) (.cse13 (<= Elevator_min Elevator_current)) (.cse5 (= Elevator_qDC2 1)) (.cse39 (and (and .cse9 .cse14) .cse7 .cse8))) (let ((.cse1 (and .cse5 .cse39)) (.cse26 (or (and .cse16 (<= .cse38 Elevator_current)) (and (<= .cse40 Elevator_max) .cse13))) (.cse29 (= Elevator_current Elevator_goal)) (.cse30 (<= (+ Elevator_dir Elevator_current 2) Elevator_max)) (.cse28 (<= 1 Elevator_dir)) (.cse36 (and (not .cse5) .cse39)) (.cse21 (or (<= Elevator_current .cse37) (= (+ Elevator_dir 1) 0))) (.cse22 (or (<= .cse37 Elevator_current) (= Elevator_dir 1))) (.cse23 (or (= .cse35 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse24 (or .cse31 (<= |Elevator_goal'| |Elevator_current'|))) (.cse33 (<= .cse38 |Elevator_current'|)) (.cse34 (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse6)) (.cse25 (not (= .cse37 Elevator_current))) (.cse20 (not Elevator_newgoal)) (.cse11 (= Elevator_qDC2 3)) (.cse17 (= Elevator_qDC1 2)) (.cse12 (not Elevator_stop)) (.cse19 (= Elevator_qDC2 2)) (.cse18 (not (= Elevator_qCSP 3))) (.cse3 (<= |Elevator_current'| Elevator_max)) (.cse4 (not (= Elevator_goal Elevator_current))) (.cse0 (<= |Elevator_goal'| Elevator_max)) (.cse2 (<= Elevator_min |Elevator_goal'|)) (.cse15 (not Elevator_passed)) (.cse10 (not (= |Elevator_current'| |Elevator_goal'|)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse12 (and .cse3 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse2)) (and .cse12 (and .cse17 (and (and .cse3 .cse18 .cse13 .cse16 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15) .cse19))) (and .cse12 .cse20 (and .cse3 .cse21 .cse4 .cse6 .cse0 .cse7 .cse8 .cse22 .cse10 .cse23 .cse24 .cse19 .cse2 .cse25 .cse9)) (and .cse26 .cse1 (let ((.cse27 (+ Elevator_dir Elevator_current))) (or (and (<= .cse27 Elevator_max) .cse28) .cse29 (and (<= Elevator_min .cse27) .cse30)))) (and .cse12 (and .cse3 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9) .cse20) (and .cse12 (let ((.cse32 (+ |Elevator_goal'| |Elevator_dir'|))) (and (or .cse31 (<= .cse32 |Elevator_current'|)) .cse21 (and .cse26 .cse0 .cse7 .cse8) (not (= .cse32 |Elevator_current'|)) (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or .cse33 .cse34) .cse22 (or (= 0 .cse35) (<= |Elevator_current'| .cse32)) .cse17 .cse19 .cse2 .cse25 (or .cse29 .cse30 .cse28))) .cse20) (and .cse20 (and .cse3 .cse13 .cse16 .cse17 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse14 .cse15)) (and .cse12 (and .cse36 .cse0 .cse2 .cse11)) (and .cse12 (and (and .cse19 .cse36) .cse0 .cse2) .cse20) (and .cse12 (and .cse21 .cse4 .cse13 .cse0 .cse7 .cse8 .cse22 .cse15 .cse10 .cse23 .cse16 .cse17 .cse24 .cse19 .cse2 (or (and .cse3 .cse33) .cse34) .cse25) .cse20) (and (and .cse12 (and (or (and Elevator_passed .cse17 .cse11) (and .cse3 .cse13 .cse16 .cse17 .cse6 .cse11)) .cse0 .cse2 .cse7 .cse8)) .cse20) (and .cse3 .cse4 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse15 .cse10 .cse16 .cse17 .cse2) (and .cse12 (and .cse2 (and .cse19 (and .cse3 (and .cse18 .cse9) .cse6 .cse0 .cse7 .cse8)))) (and .cse3 .cse4 .cse13 .cse16 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15 .cse10)))))) [2018-09-23 19:31:32,411 INFO L426 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-09-23 19:31:32,411 INFO L426 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-09-23 19:31:32,412 INFO L426 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-09-23 19:31:32,413 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-09-23 19:31:32,413 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-09-23 19:31:32,433 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:31:32 BoogieIcfgContainer [2018-09-23 19:31:32,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:31:32,435 INFO L168 Benchmark]: Toolchain (without parser) took 40957.52 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 378.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -36.9 MB). Peak memory consumption was 847.2 MB. Max. memory is 7.1 GB. [2018-09-23 19:31:32,436 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-09-23 19:31:32,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.22 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-09-23 19:31:32,436 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 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-09-23 19:31:32,437 INFO L168 Benchmark]: RCFGBuilder took 884.79 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:31:32,437 INFO L168 Benchmark]: TraceAbstraction took 39982.54 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 378.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.6 MB). Peak memory consumption was 815.5 MB. Max. memory is 7.1 GB. [2018-09-23 19:31:32,441 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 39.22 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 40.24 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 884.79 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39982.54 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 378.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.6 MB). Peak memory consumption was 815.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((goal' <= max && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && min <= goal') || (((((((((current' <= max && !(goal == current)) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (((((((((current' <= max && !(goal == current)) && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (!stop && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !passed) && current <= max) && qDC1 == 2) && min <= goal')) || (!stop && qDC1 == 2 && (((((((((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && qDC2 == 2)) || ((!stop && !newgoal) && (((((((((((((current' <= max && (current <= dir + goal || dir + 1 == 0)) && !(goal == current)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && (current <= max && min < current + 1) && qDC1 <= 1)) || ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max)))) || ((!stop && ((((((current' <= max && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !newgoal)) || ((!stop && ((((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && goal' <= max) && goal <= max) && min <= goal) && !(goal' + dir' == current')) && (1 <= dir' || current' + dir' + 2 <= max)) && (min + 1 <= current' || (current' + 1 <= max && min <= current'))) && (dir + goal <= current || dir == 1)) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && ((current == goal || dir + current + 2 <= max) || 1 <= dir)) && !newgoal)) || (!newgoal && ((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qCSP == 1) && !passed)) || (!stop && (((!(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && qDC2 == 3)) || ((!stop && ((qDC2 == 2 && !(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && !newgoal)) || ((!stop && ((((((((((((((((current <= dir + goal || dir + 1 == 0) && !(goal == current)) && min <= current) && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !passed) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && !(dir + goal == current)) && !newgoal)) || ((!stop && ((((((passed && qDC1 == 2) && qDC2 == 3) || (((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((((((((((((current' <= max && !(goal == current)) && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && !passed) && !(current' == goal')) && current <= max) && qDC1 == 2) && min <= goal')) || (!stop && min <= goal' && qDC2 == 2 && ((((current' <= max && !(qCSP == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && min <= current') && goal' <= max) && goal <= max) && min <= goal)) || (((((((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && !(current' == goal')) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 39.8s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 8.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1306 SDtfs, 3380 SDslu, 5274 SDs, 0 SdLazy, 1671 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3703 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1176occurred in iteration=16, 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 6236 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 42 NumberOfFragments, 929 HoareAnnotationTreeSize, 1 FomulaSimplifications, 49544 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 211987 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 755265 SizeOfPredicates, 35 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 1304/1655 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-31-32-455.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-31-32-455.csv Received shutdown request...