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/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:34:51,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:34:51,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:34:51,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:34:51,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:34:51,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:34:51,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:34:51,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:34:51,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:34:51,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:34:51,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:34:51,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:34:51,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:34:51,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:34:51,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:34:51,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:34:51,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:34:51,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:34:51,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:34:51,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:34:51,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:34:51,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:34:51,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:34:51,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:34:51,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:34:51,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:34:51,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:34:51,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:34:51,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:34:51,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:34:51,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:34:51,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:34:51,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:34:51,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:34:51,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:34:51,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:34:51,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:34:51,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:34:51,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:34:51,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:34:51,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:34:51,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:34:51,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:34:51,203 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:34:51,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:34:51,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:34:51,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:34:51,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:34:51,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:34:51,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:34:51,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:34:51,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:34:51,205 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:34:51,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:34:51,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:34:51,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:34:51,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:34:51,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:34:51,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:34:51,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:34:51,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:34:51,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:34:51,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:34:51,209 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:34:51,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:34:51,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:34:51,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:34:51,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:34:51,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:34:51,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:34:51,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:34:51,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:34:51,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-10-02 11:34:51,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-10-02 11:34:51,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:34:51,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:34:51,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:34:51,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:34:51,391 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:34:51,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,435 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:34:51,435 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:34:51,435 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:34:51,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:34:51,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:34:51,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:34:51,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:34:51,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/1) ... [2018-10-02 11:34:51,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:34:51,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:34:51,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:34:51,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:34:51,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34: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-10-02 11:34:51,548 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-02 11:34:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-02 11:34:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-02 11:34:52,257 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:34:52,258 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:34:52 BoogieIcfgContainer [2018-10-02 11:34:52,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:34:52,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:34:52,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:34:52,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:34:52,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:51" (1/2) ... [2018-10-02 11:34:52,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df5d54c and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:34:52, skipping insertion in model container [2018-10-02 11:34:52,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:34:52" (2/2) ... [2018-10-02 11:34:52,266 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-10-02 11:34:52,276 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:34:52,285 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:34:52,334 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:34:52,335 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:34:52,335 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:34:52,336 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:34:52,336 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:34:52,336 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:34:52,336 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:34:52,336 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:34:52,336 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:34:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-02 11:34:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-02 11:34:52,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:52,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-02 11:34:52,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:52,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-02 11:34:52,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:52,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:52,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:52,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:52,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:52,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 11:34:52,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:52,562 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-02 11:34:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:52,752 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-10-02 11:34:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:52,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-02 11:34:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:52,773 INFO L225 Difference]: With dead ends: 84 [2018-10-02 11:34:52,773 INFO L226 Difference]: Without dead ends: 54 [2018-10-02 11:34:52,780 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-10-02 11:34:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-02 11:34:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-02 11:34:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:34:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-10-02 11:34:52,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-10-02 11:34:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:52,828 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-10-02 11:34:52,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-10-02 11:34:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:34:52,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:52,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:52,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:52,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-10-02 11:34:52,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:52,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:52,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:34:52,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:52,881 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-10-02 11:34:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:53,091 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-10-02 11:34:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:53,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:34:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:53,096 INFO L225 Difference]: With dead ends: 157 [2018-10-02 11:34:53,097 INFO L226 Difference]: Without dead ends: 101 [2018-10-02 11:34:53,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-02 11:34:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-02 11:34:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-02 11:34:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-10-02 11:34:53,125 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-10-02 11:34:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:53,126 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-10-02 11:34:53,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-10-02 11:34:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:34:53,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:53,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:53,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-10-02 11:34:53,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:53,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:53,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:53,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:53,185 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-10-02 11:34:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:53,399 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-10-02 11:34:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:53,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:34:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:53,403 INFO L225 Difference]: With dead ends: 205 [2018-10-02 11:34:53,404 INFO L226 Difference]: Without dead ends: 104 [2018-10-02 11:34:53,405 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-10-02 11:34:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-02 11:34:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-10-02 11:34:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-02 11:34:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-10-02 11:34:53,418 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-10-02 11:34:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:53,418 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-10-02 11:34:53,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-10-02 11:34:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:34:53,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:53,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:53,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:53,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-10-02 11:34:53,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:53,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:34:53,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:34:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:34:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:34:53,620 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-10-02 11:34:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:53,760 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-10-02 11:34:53,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:34:53,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-02 11:34:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:53,768 INFO L225 Difference]: With dead ends: 321 [2018-10-02 11:34:53,768 INFO L226 Difference]: Without dead ends: 209 [2018-10-02 11:34:53,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:34:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-02 11:34:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-02 11:34:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-02 11:34:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-10-02 11:34:53,791 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-10-02 11:34:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:53,792 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-10-02 11:34:53,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:34:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-10-02 11:34:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 11:34:53,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:53,794 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:53,794 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:53,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-10-02 11:34:53,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:53,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-02 11:34:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:53,845 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-10-02 11:34:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:53,979 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-10-02 11:34:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:53,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 11:34:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:53,985 INFO L225 Difference]: With dead ends: 522 [2018-10-02 11:34:53,986 INFO L226 Difference]: Without dead ends: 310 [2018-10-02 11:34:53,989 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-10-02 11:34:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-02 11:34:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-10-02 11:34:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 11:34:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-10-02 11:34:54,011 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-10-02 11:34:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:54,012 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-10-02 11:34:54,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-10-02 11:34:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 11:34:54,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:54,014 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:54,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:54,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-10-02 11:34:54,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-02 11:34:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:54,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:54,090 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-10-02 11:34:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:54,217 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-10-02 11:34:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-02 11:34:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:54,222 INFO L225 Difference]: With dead ends: 588 [2018-10-02 11:34:54,223 INFO L226 Difference]: Without dead ends: 367 [2018-10-02 11:34:54,224 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-10-02 11:34:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-02 11:34:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-10-02 11:34:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-02 11:34:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-10-02 11:34:54,246 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-10-02 11:34:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:54,247 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-10-02 11:34:54,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-10-02 11:34:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:34:54,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:54,249 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-02 11:34:54,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:54,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-10-02 11:34:54,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 11:34:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:54,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:54,304 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-10-02 11:34:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:54,705 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-10-02 11:34:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:54,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 11:34:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:54,713 INFO L225 Difference]: With dead ends: 880 [2018-10-02 11:34:54,713 INFO L226 Difference]: Without dead ends: 542 [2018-10-02 11:34:54,714 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-10-02 11:34:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-02 11:34:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-10-02 11:34:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-02 11:34:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-10-02 11:34:54,734 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-10-02 11:34:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-10-02 11:34:54,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-10-02 11:34:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:34:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:54,737 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-02 11:34:54,737 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-10-02 11:34:54,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:34:54,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:54,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:34:54,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:34:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:34:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:34:54,867 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-10-02 11:34:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:54,993 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-10-02 11:34:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:54,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-02 11:34:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:55,001 INFO L225 Difference]: With dead ends: 1096 [2018-10-02 11:34:55,002 INFO L226 Difference]: Without dead ends: 731 [2018-10-02 11:34:55,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:34:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-02 11:34:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-10-02 11:34:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-02 11:34:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-10-02 11:34:55,033 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-10-02 11:34:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:55,034 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-10-02 11:34:55,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:34:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-10-02 11:34:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-02 11:34:55,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:55,037 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-02 11:34:55,037 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:55,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:55,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-10-02 11:34:55,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:55,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:55,422 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-10-02 11:34:55,731 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-02 11:34:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:55,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:34:55,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:34:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:55,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:34:56,279 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-02 11:34:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:34:56,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:34:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-02 11:34:56,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:34:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:34:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:34:56,363 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-10-02 11:34:57,002 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 11:34:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:57,542 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-10-02 11:34:57,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:34:57,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-02 11:34:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:57,550 INFO L225 Difference]: With dead ends: 1293 [2018-10-02 11:34:57,551 INFO L226 Difference]: Without dead ends: 1292 [2018-10-02 11:34:57,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:34:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-02 11:34:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-10-02 11:34:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-02 11:34:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-10-02 11:34:57,609 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-10-02 11:34:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:57,610 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-10-02 11:34:57,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:34:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-10-02 11:34:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-02 11:34:57,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:57,616 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-10-02 11:34:57,616 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:57,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-10-02 11:34:57,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:57,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:57,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:57,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:34:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:34:57,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:34:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:34:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:34:57,857 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-10-02 11:34:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:58,176 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-10-02 11:34:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:34:58,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-02 11:34:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:58,188 INFO L225 Difference]: With dead ends: 2655 [2018-10-02 11:34:58,189 INFO L226 Difference]: Without dead ends: 1510 [2018-10-02 11:34:58,191 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-10-02 11:34:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-02 11:34:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-10-02 11:34:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-10-02 11:34:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-10-02 11:34:58,255 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-10-02 11:34:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:58,255 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-10-02 11:34:58,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:34:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-10-02 11:34:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:34:58,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:58,258 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:58,259 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:58,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-10-02 11:34:58,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-02 11:34:58,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:58,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:34:58,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:34:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:34:58,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:34:58,453 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-10-02 11:34:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:58,719 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-10-02 11:34:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:58,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-02 11:34:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:58,729 INFO L225 Difference]: With dead ends: 2726 [2018-10-02 11:34:58,729 INFO L226 Difference]: Without dead ends: 1469 [2018-10-02 11:34:58,731 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-10-02 11:34:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-02 11:34:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-10-02 11:34:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-10-02 11:34:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-10-02 11:34:58,791 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-10-02 11:34:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:58,792 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-10-02 11:34:58,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:34:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-10-02 11:34:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-02 11:34:58,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:58,795 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:58,796 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:58,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-10-02 11:34:58,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:58,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-02 11:34:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:58,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:58,893 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-10-02 11:34:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:59,154 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-10-02 11:34:59,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:59,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-02 11:34:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:59,163 INFO L225 Difference]: With dead ends: 2942 [2018-10-02 11:34:59,163 INFO L226 Difference]: Without dead ends: 1457 [2018-10-02 11:34:59,166 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-10-02 11:34:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-02 11:34:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-10-02 11:34:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-10-02 11:34:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-10-02 11:34:59,216 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-10-02 11:34:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:59,217 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-10-02 11:34:59,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-10-02 11:34:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-02 11:34:59,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:59,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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-10-02 11:34:59,220 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:59,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-10-02 11:34:59,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:59,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:59,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:34:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:34:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 11:34:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:34:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:34:59,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:34:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:34:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:34:59,311 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-10-02 11:34:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:34:59,444 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-10-02 11:34:59,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:34:59,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-02 11:34:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:34:59,457 INFO L225 Difference]: With dead ends: 3297 [2018-10-02 11:34:59,457 INFO L226 Difference]: Without dead ends: 1830 [2018-10-02 11:34:59,460 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-10-02 11:34:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-02 11:34:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-10-02 11:34:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-10-02 11:34:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-10-02 11:34:59,517 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-10-02 11:34:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:34:59,517 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-10-02 11:34:59,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:34:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-10-02 11:34:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-02 11:34:59,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:34:59,521 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:34:59,521 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:34:59,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:34:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-10-02 11:34:59,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:34:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:34:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:59,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:34:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:34:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:00,022 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-02 11:35:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 11:35:00,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:00,447 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-10-02 11:35:00,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:00,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-02 11:35:00,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:00,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-02 11:35:00,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:00,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:00,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:00,931 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-10-02 11:35:01,267 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-02 11:35:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:02,795 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-10-02 11:35:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:02,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-10-02 11:35:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:02,811 INFO L225 Difference]: With dead ends: 3128 [2018-10-02 11:35:02,811 INFO L226 Difference]: Without dead ends: 3127 [2018-10-02 11:35:02,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-10-02 11:35:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-10-02 11:35:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-02 11:35:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-10-02 11:35:02,865 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-10-02 11:35:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:02,865 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-10-02 11:35:02,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-10-02 11:35:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-02 11:35:02,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:02,869 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:02,869 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:02,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-10-02 11:35:02,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:02,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:02,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-02 11:35:02,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:02,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:02,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:35:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:35:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:35:02,931 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-10-02 11:35:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:02,987 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-10-02 11:35:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:35:02,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-02 11:35:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:02,996 INFO L225 Difference]: With dead ends: 2399 [2018-10-02 11:35:02,996 INFO L226 Difference]: Without dead ends: 1130 [2018-10-02 11:35:02,998 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-10-02 11:35:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-02 11:35:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-10-02 11:35:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-10-02 11:35:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-10-02 11:35:03,036 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-10-02 11:35:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:03,036 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-10-02 11:35:03,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:35:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-10-02 11:35:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-02 11:35:03,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:03,040 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1] [2018-10-02 11:35:03,040 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:03,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-10-02 11:35:03,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:03,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 11:35:03,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:03,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:03,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:35:03,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:35:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:35:03,126 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-10-02 11:35:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:03,487 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-10-02 11:35:03,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:35:03,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-02 11:35:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:03,491 INFO L225 Difference]: With dead ends: 2013 [2018-10-02 11:35:03,491 INFO L226 Difference]: Without dead ends: 850 [2018-10-02 11:35:03,493 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-10-02 11:35:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-10-02 11:35:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-10-02 11:35:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-02 11:35:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-10-02 11:35:03,516 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-10-02 11:35:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:03,517 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-10-02 11:35:03,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:35:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-10-02 11:35:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-02 11:35:03,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:03,519 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-10-02 11:35:03,519 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:03,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-10-02 11:35:03,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:03,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-02 11:35:03,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:03,890 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-10-02 11:35:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:03,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-02 11:35:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-10-02 11:35:04,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:35:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:35:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:35:04,038 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-10-02 11:35:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:05,000 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-10-02 11:35:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:05,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-02 11:35:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:05,005 INFO L225 Difference]: With dead ends: 1537 [2018-10-02 11:35:05,005 INFO L226 Difference]: Without dead ends: 1017 [2018-10-02 11:35:05,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-02 11:35:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-10-02 11:35:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-10-02 11:35:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-10-02 11:35:05,035 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-10-02 11:35:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:05,036 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-10-02 11:35:05,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:35:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-10-02 11:35:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-02 11:35:05,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:05,038 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:05,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:05,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-10-02 11:35:05,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:35:05,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:05,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:05,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:05,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-02 11:35:05,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:05,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 11:35:05,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:05,438 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-10-02 11:35:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:05,520 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-10-02 11:35:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:35:05,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-02 11:35:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:05,523 INFO L225 Difference]: With dead ends: 1396 [2018-10-02 11:35:05,523 INFO L226 Difference]: Without dead ends: 661 [2018-10-02 11:35:05,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-02 11:35:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-10-02 11:35:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-02 11:35:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-10-02 11:35:05,545 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-10-02 11:35:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:05,545 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-10-02 11:35:05,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-10-02 11:35:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-02 11:35:05,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:05,548 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:05,548 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:05,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-10-02 11:35:05,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-02 11:35:05,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:05,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:05,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:35:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:35:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:35:05,627 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-10-02 11:35:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:05,956 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-10-02 11:35:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:35:05,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-02 11:35:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:05,960 INFO L225 Difference]: With dead ends: 1306 [2018-10-02 11:35:05,960 INFO L226 Difference]: Without dead ends: 667 [2018-10-02 11:35:05,961 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-10-02 11:35:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-02 11:35:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-10-02 11:35:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-02 11:35:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-10-02 11:35:05,983 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-10-02 11:35:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:05,984 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-10-02 11:35:05,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:35:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-10-02 11:35:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-02 11:35:05,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:05,986 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:05,986 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-10-02 11:35:05,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-02 11:35:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:06,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:06,252 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-10-02 11:35:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:06,297 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-10-02 11:35:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:35:06,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-02 11:35:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:06,299 INFO L225 Difference]: With dead ends: 930 [2018-10-02 11:35:06,300 INFO L226 Difference]: Without dead ends: 336 [2018-10-02 11:35:06,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-02 11:35:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-10-02 11:35:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-02 11:35:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-10-02 11:35:06,315 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-10-02 11:35:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:06,315 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-10-02 11:35:06,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-10-02 11:35:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-02 11:35:06,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:06,317 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:06,317 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:06,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-10-02 11:35:06,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:06,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-02 11:35:06,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:06,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:06,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:35:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:35:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:35:06,406 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-10-02 11:35:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:06,695 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-10-02 11:35:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:35:06,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-02 11:35:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:06,697 INFO L225 Difference]: With dead ends: 663 [2018-10-02 11:35:06,697 INFO L226 Difference]: Without dead ends: 335 [2018-10-02 11:35:06,698 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-10-02 11:35:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-02 11:35:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-10-02 11:35:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-02 11:35:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-10-02 11:35:06,713 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-10-02 11:35:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:06,713 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-10-02 11:35:06,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:35:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-10-02 11:35:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-02 11:35:06,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:06,715 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:06,716 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:06,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-10-02 11:35:06,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:06,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:35:07,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:07,495 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:07,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:35:07,554 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:35:07,554 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:35:07,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-02 11:35:08,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:08,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-02 11:35:08,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:35:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:35:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:08,082 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 17 states. [2018-10-02 11:35:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:09,048 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-10-02 11:35:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:35:09,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-10-02 11:35:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:09,053 INFO L225 Difference]: With dead ends: 1064 [2018-10-02 11:35:09,053 INFO L226 Difference]: Without dead ends: 1063 [2018-10-02 11:35:09,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:35:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-02 11:35:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-10-02 11:35:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-02 11:35:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-10-02 11:35:09,073 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-10-02 11:35:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:09,073 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-10-02 11:35:09,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:35:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-10-02 11:35:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-02 11:35:09,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:09,075 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:09,075 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-10-02 11:35:09,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:35:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-02 11:35:09,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:09,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:09,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:09,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:09,180 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-10-02 11:35:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:09,235 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-10-02 11:35:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:35:09,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-02 11:35:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:09,237 INFO L225 Difference]: With dead ends: 673 [2018-10-02 11:35:09,237 INFO L226 Difference]: Without dead ends: 468 [2018-10-02 11:35:09,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-02 11:35:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-10-02 11:35:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-02 11:35:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-10-02 11:35:09,249 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-10-02 11:35:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:09,250 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-10-02 11:35:09,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-10-02 11:35:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-02 11:35:09,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:09,252 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 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] [2018-10-02 11:35:09,252 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:09,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-10-02 11:35:09,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-02 11:35:09,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:09,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:09,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-02 11:35:09,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-02 11:35:09,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:09,802 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 9 states. [2018-10-02 11:35:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:10,209 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-10-02 11:35:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:10,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-10-02 11:35:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:10,213 INFO L225 Difference]: With dead ends: 845 [2018-10-02 11:35:10,213 INFO L226 Difference]: Without dead ends: 844 [2018-10-02 11:35:10,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-02 11:35:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-10-02 11:35:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-02 11:35:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-10-02 11:35:10,240 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-10-02 11:35:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:10,241 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-10-02 11:35:10,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-10-02 11:35:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-02 11:35:10,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:10,243 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:10,243 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:10,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-10-02 11:35:10,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:10,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-10-02 11:35:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:10,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:35:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:35:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:35:10,337 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-10-02 11:35:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:10,413 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-10-02 11:35:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:35:10,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-02 11:35:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:10,415 INFO L225 Difference]: With dead ends: 1086 [2018-10-02 11:35:10,415 INFO L226 Difference]: Without dead ends: 479 [2018-10-02 11:35:10,416 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-10-02 11:35:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-02 11:35:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-10-02 11:35:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-02 11:35:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-10-02 11:35:10,436 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-10-02 11:35:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:10,436 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-10-02 11:35:10,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:35:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-10-02 11:35:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-02 11:35:10,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:10,438 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:10,438 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-02 11:35:10,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-10-02 11:35:10,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:10,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:35:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:10,734 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-02 11:35:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-02 11:35:11,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:11,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:11,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:11,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-02 11:35:11,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:11,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-10-02 11:35:11,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:35:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:35:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:35:11,889 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-10-02 11:35:12,660 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-10-02 11:35:13,145 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-10-02 11:35:13,613 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-10-02 11:35:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:14,266 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-10-02 11:35:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:14,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-10-02 11:35:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:14,273 INFO L225 Difference]: With dead ends: 970 [2018-10-02 11:35:14,273 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:35:14,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:35:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:35:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:35:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:35:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:35:14,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-10-02 11:35:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:14,276 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:35:14,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:35:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:35:14,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:35:14,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:35:14,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:14,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:15,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:15,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:15,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:35:15,945 WARN L178 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 538 DAG size of output: 452 [2018-10-02 11:35:21,902 WARN L178 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 431 DAG size of output: 153 [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-10-02 11:35:21,907 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-10-02 11:35:21,908 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-10-02 11:35:21,908 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-10-02 11:35:21,908 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-10-02 11:35:21,908 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L421 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse41 (+ Elevator_dir 1))) (let ((.cse39 (+ Elevator_min 1)) (.cse34 (+ Elevator_dir Elevator_goal)) (.cse28 (= Elevator_qCSP 1)) (.cse22 (= Elevator_qCSP 3)) (.cse38 (+ Elevator_dir Elevator_current)) (.cse3 (not Elevator_stop)) (.cse4 (not (= Elevator_current Elevator_goal))) (.cse5 (<= Elevator_min Elevator_current)) (.cse6 (<= Elevator_current Elevator_max)) (.cse18 (= Elevator_qDC1 2)) (.cse7 (= Elevator_qDC2 2)) (.cse35 (= Elevator_dir 1)) (.cse29 (<= Elevator_current Elevator_goal)) (.cse40 (= .cse41 0))) (let ((.cse30 (or .cse29 .cse40)) (.cse21 (= Elevator_qDC2 3)) (.cse33 (not (= Elevator_min Elevator_goal))) (.cse12 (or (<= .cse41 0) (and (not (= Elevator_goal Elevator_current)) .cse29))) (.cse14 (or (<= Elevator_goal Elevator_current) .cse35)) (.cse15 (or .cse35 .cse40)) (.cse31 (and .cse3 (and .cse4 .cse5 .cse6 .cse18 .cse7))) (.cse27 (= Elevator_min Elevator_current)) (.cse36 (<= Elevator_min .cse38)) (.cse26 (<= Elevator_dir 1)) (.cse17 (not .cse22)) (.cse8 (<= Elevator_qDC1 1)) (.cse9 (not Elevator_passed)) (.cse19 (not .cse28)) (.cse20 (or (<= Elevator_current .cse34) .cse40)) (.cse23 (or (and .cse6 (<= .cse39 Elevator_current)) (and (<= (+ Elevator_current 1) Elevator_max) .cse5))) (.cse11 (or (<= (+ Elevator_min 2) .cse38) (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2)))) (.cse16 (<= Elevator_c2 2)) (.cse0 (<= Elevator_c2 Elevator_c3)) (.cse32 (and .cse5 .cse6 .cse18 .cse28)) (.cse37 (= Elevator_qDC2 1)) (.cse2 (not Elevator_newgoal)) (.cse10 (<= Elevator_min Elevator_goal)) (.cse1 (<= Elevator_goal Elevator_max)) (.cse24 (not (= .cse34 Elevator_current))) (.cse25 (or (<= .cse34 Elevator_current) .cse35)) (.cse13 (not Elevator_start))) (or (and (and .cse0 .cse1 (and .cse2 (and .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse16 .cse0 (and (and .cse3 (and .cse4 .cse17 .cse5 .cse6 .cse18 .cse7)) .cse19)) .cse1 .cse10 .cse13) (and .cse20 (or (and .cse16 (and (and (and .cse3 .cse21 .cse18) .cse9) .cse2 .cse22) .cse0) (and .cse3 (<= 0 Elevator_c3) .cse18 (<= Elevator_c2 0) .cse21 .cse2 .cse10 .cse22)) .cse23 .cse11 .cse1 .cse24 .cse25 .cse13) (and .cse26 (and (and .cse3 .cse0 .cse2 (and (and .cse4 .cse27 .cse8 .cse28) .cse7)) .cse1) .cse29 (<= Elevator_current (+ Elevator_dir Elevator_min)) .cse13) (and .cse30 (and (and (and .cse3 (and .cse5 .cse6 .cse7 (and .cse4 .cse8 .cse9))) .cse2 .cse22) .cse1 .cse10) .cse14) (and .cse3 .cse0 .cse18 (and .cse4 .cse5 .cse6) .cse21 .cse9) (and .cse30 (and (and .cse16 (and .cse31 .cse2 .cse22)) .cse1 .cse10) .cse14) (and .cse3 .cse32 .cse0 .cse21 .cse9) (and .cse33 .cse27 .cse2 .cse10 .cse8 .cse3 .cse0 (<= .cse34 (+ Elevator_max 1)) .cse35 .cse7 .cse22) (and .cse36 .cse26 (and (and .cse3 .cse0 (and (and (and .cse17 .cse27 .cse8) .cse33) .cse7) .cse19) .cse1) .cse29 .cse13) (and .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 .cse0 (and .cse31 .cse2) .cse1 .cse10)) (and (and .cse0 .cse10 (and .cse37 (and .cse28 .cse8 .cse9) .cse2)) .cse20 .cse23 .cse11 .cse1 .cse24 .cse25 .cse13) (and (<= .cse38 Elevator_goal) (and .cse1 (and .cse37 (and .cse0 (and .cse27 (<= .cse39 Elevator_max) .cse8 .cse28)))) .cse36 .cse26) (and (and .cse5 .cse6 .cse0 (and (and .cse3 (and .cse4 .cse17 .cse7 .cse8 .cse9)) .cse19)) .cse1 .cse10 .cse13) (and .cse20 .cse23 .cse11 (and .cse16 .cse0 (and .cse32 .cse37 .cse2) .cse10) .cse1 .cse24 .cse25 .cse13))))) [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-10-02 11:35:21,909 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-10-02 11:35:21,910 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-10-02 11:35:21,930 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:35:21 BoogieIcfgContainer [2018-10-02 11:35:21,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:35:21,931 INFO L168 Benchmark]: Toolchain (without parser) took 30551.28 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 315.2 MB). Peak memory consumption was 832.9 MB. Max. memory is 7.1 GB. [2018-10-02 11:35:21,932 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:35:21,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:35:21,933 INFO L168 Benchmark]: Boogie Preprocessor took 28.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:35:21,933 INFO L168 Benchmark]: RCFGBuilder took 790.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:35:21,934 INFO L168 Benchmark]: TraceAbstraction took 29670.33 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 283.5 MB). Peak memory consumption was 801.2 MB. Max. memory is 7.1 GB. [2018-10-02 11:35:21,937 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 790.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29670.33 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 283.5 MB). Peak memory consumption was 801.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c2 <= c3 && goal <= max) && !newgoal && !stop && ((((!(current == goal) && min <= current) && current <= max) && qDC2 == 2) && qDC1 <= 1) && !passed) && min <= goal) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && (dir + 1 <= 0 || (!(goal == current) && current <= goal))) && !start) && (goal <= current || dir == 1)) && (dir == 1 || dir + 1 == 0)) || (((((c2 <= 2 && c2 <= c3) && (!stop && ((((!(current == goal) && !(qCSP == 3)) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((((((current <= dir + goal || dir + 1 == 0) && (((c2 <= 2 && ((((!stop && qDC2 == 3) && qDC1 == 2) && !passed) && !newgoal) && qCSP == 3) && c2 <= c3) || (((((((!stop && 0 <= c3) && qDC1 == 2) && c2 <= 0) && qDC2 == 3) && !newgoal) && min <= goal) && qCSP == 3))) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || ((((dir <= 1 && (((!stop && c2 <= c3) && !newgoal) && (((!(current == goal) && min == current) && qDC1 <= 1) && qCSP == 1) && qDC2 == 2) && goal <= max) && current <= goal) && current <= dir + min) && !start)) || (((current <= goal || dir + 1 == 0) && ((((!stop && ((min <= current && current <= max) && qDC2 == 2) && (!(current == goal) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || (((((!stop && c2 <= c3) && qDC1 == 2) && (!(current == goal) && min <= current) && current <= max) && qDC2 == 3) && !passed)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || ((((!stop && ((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && c2 <= c3) && qDC2 == 3) && !passed)) || ((((((((((!(min == goal) && min == current) && !newgoal) && min <= goal) && qDC1 <= 1) && !stop) && c2 <= c3) && dir + goal <= max + 1) && dir == 1) && qDC2 == 2) && qCSP == 3)) || ((((min <= dir + current && dir <= 1) && (((!stop && c2 <= c3) && (((!(qCSP == 3) && min == current) && qDC1 <= 1) && !(min == goal)) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && current <= goal) && !start)) || ((((((min + 2 <= dir + current || current + min <= dir + 2 * goal + 2) && (dir + 1 <= 0 || (!(goal == current) && current <= goal))) && !start) && (goal <= current || dir == 1)) && (dir == 1 || dir + 1 == 0)) && (((c2 <= 2 && c2 <= c3) && (!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && goal <= max) && min <= goal)) || (((((((((c2 <= c3 && min <= goal) && (qDC2 == 1 && (qCSP == 1 && qDC1 <= 1) && !passed) && !newgoal) && (current <= dir + goal || dir + 1 == 0)) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((dir + current <= goal && goal <= max && qDC2 == 1 && c2 <= c3 && ((min == current && min + 1 <= max) && qDC1 <= 1) && qCSP == 1) && min <= dir + current) && dir <= 1)) || ((((((min <= current && current <= max) && c2 <= c3) && (!stop && (((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && ((c2 <= 2 && c2 <= c3) && ((((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && qDC2 == 1) && !newgoal) && min <= goal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 29.5s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4287 SDslu, 4567 SDs, 0 SdLazy, 2480 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 760 SyntacticMatches, 14 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, 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.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 896 HoareAnnotationTreeSize, 1 FomulaSimplifications, 325389 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 162317 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 2091531 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 4169/5710 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/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-35-21-952.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-35-21-952.csv Received shutdown request...