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_PUPT.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:02:55,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:02:55,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:02:55,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:02:55,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:02:55,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:02:55,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:02:55,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:02:55,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:02:55,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:02:55,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:02:55,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:02:55,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:02:55,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:02:55,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:02:55,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:02:55,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:02:55,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:02:55,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:02:55,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:02:55,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:02:55,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:02:55,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:02:55,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:02:55,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:02:55,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:02:55,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:02:55,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:02:55,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:02:55,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:02:55,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:02:55,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:02:55,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:02:55,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:02:55,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:02:55,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:02:55,506 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:02:55,520 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:02:55,520 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:02:55,521 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:02:55,521 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:02:55,522 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:02:55,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:02:55,523 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:02:55,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:02:55,523 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:02:55,523 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:02:55,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:02:55,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:02:55,524 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:02:55,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:02:55,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:02:55,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:02:55,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:02:55,525 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:02:55,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:02:55,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:02:55,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:02:55,526 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:02:55,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:02:55,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:02:55,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:02:55,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:02:55,527 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:02:55,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:02:55,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:02:55,528 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:02:55,528 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:02:55,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:02:55,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:02:55,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:02:55,599 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:02:55,600 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:02:55,601 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-03 09:02:55,601 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-10-03 09:02:55,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:02:55,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:02:55,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:02:55,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:02:55,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,713 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 09:02:55,713 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 09:02:55,713 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 09:02:55,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:02:55,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:02:55,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:02:55,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:02:55,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:02:55,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:02:55,857 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-03 09:02:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-03 09:02:55,857 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-03 09:02:56,457 INFO L337 CfgBuilder]: Using library mode [2018-10-03 09:02:56,458 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56 BoogieIcfgContainer [2018-10-03 09:02:56,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:02:56,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:02:56,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:02:56,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:02:56,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/2) ... [2018-10-03 09:02:56,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aeb17f1 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:02:56, skipping insertion in model container [2018-10-03 09:02:56,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56" (2/2) ... [2018-10-03 09:02:56,466 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-10-03 09:02:56,476 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:02:56,485 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:02:56,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:02:56,544 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:02:56,544 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:02:56,544 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:02:56,544 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:02:56,544 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:02:56,544 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:02:56,545 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:02:56,545 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:02:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-03 09:02:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-03 09:02:56,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:56,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-03 09:02:56,578 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:56,585 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-03 09:02:56,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:56,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:56,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,839 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-03 09:02:56,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:56,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-03 09:02:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:56,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:56,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:56,869 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-03 09:02:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,050 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-10-03 09:02:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:57,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-03 09:02:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,073 INFO L225 Difference]: With dead ends: 84 [2018-10-03 09:02:57,074 INFO L226 Difference]: Without dead ends: 54 [2018-10-03 09:02:57,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-03 09:02:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-03 09:02:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-03 09:02:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-10-03 09:02:57,122 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-10-03 09:02:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,123 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-10-03 09:02:57,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-10-03 09:02:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:02:57,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:57,125 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:57,125 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-10-03 09:02:57,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,169 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-03 09:02:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:57,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:57,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:57,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,173 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-10-03 09:02:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,395 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-10-03 09:02:57,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:57,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-03 09:02:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,399 INFO L225 Difference]: With dead ends: 157 [2018-10-03 09:02:57,399 INFO L226 Difference]: Without dead ends: 101 [2018-10-03 09:02:57,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-03 09:02:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-03 09:02:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-03 09:02:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-10-03 09:02:57,431 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-10-03 09:02:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,432 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-10-03 09:02:57,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-10-03 09:02:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:02:57,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:57,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:57,434 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-10-03 09:02:57,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,504 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-03 09:02:57,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:57,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:57,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,506 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-10-03 09:02:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,701 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-10-03 09:02:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:57,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-03 09:02:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,704 INFO L225 Difference]: With dead ends: 205 [2018-10-03 09:02:57,704 INFO L226 Difference]: Without dead ends: 104 [2018-10-03 09:02:57,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-03 09:02:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-10-03 09:02:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 09:02:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-10-03 09:02:57,729 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-10-03 09:02:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,732 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-10-03 09:02:57,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-10-03 09:02:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-03 09:02:57,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,734 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-03 09:02:57,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:57,735 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-10-03 09:02:57,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,937 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-03 09:02:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:02:57,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:02:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:02:57,943 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,943 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-10-03 09:02:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,083 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-10-03 09:02:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:02:58,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-03 09:02:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,087 INFO L225 Difference]: With dead ends: 321 [2018-10-03 09:02:58,087 INFO L226 Difference]: Without dead ends: 209 [2018-10-03 09:02:58,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 3 [2018-10-03 09:02:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-03 09:02:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-03 09:02:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-03 09:02:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-10-03 09:02:58,108 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-10-03 09:02:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,108 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-10-03 09:02:58,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:02:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-10-03 09:02:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 09:02:58,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,110 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-03 09:02:58,111 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:58,111 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-10-03 09:02:58,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:58,166 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-03 09:02:58,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:58,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:58,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:58,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:58,168 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-10-03 09:02:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,284 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-10-03 09:02:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:58,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-03 09:02:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,288 INFO L225 Difference]: With dead ends: 522 [2018-10-03 09:02:58,288 INFO L226 Difference]: Without dead ends: 310 [2018-10-03 09:02:58,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-03 09:02:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-10-03 09:02:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-03 09:02:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-10-03 09:02:58,311 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-10-03 09:02:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,312 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-10-03 09:02:58,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-10-03 09:02:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-03 09:02:58,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,314 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-03 09:02:58,314 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:58,314 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-10-03 09:02:58,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:58,355 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-03 09:02:58,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:58,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:58,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:58,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:58,356 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-10-03 09:02:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,474 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-10-03 09:02:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:58,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-03 09:02:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,479 INFO L225 Difference]: With dead ends: 588 [2018-10-03 09:02:58,479 INFO L226 Difference]: Without dead ends: 367 [2018-10-03 09:02:58,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-03 09:02:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-10-03 09:02:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-03 09:02:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-10-03 09:02:58,515 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-10-03 09:02:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,516 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-10-03 09:02:58,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-10-03 09:02:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 09:02:58,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,519 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-03 09:02:58,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:58,519 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-10-03 09:02:58,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:58,585 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-03 09:02:58,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:58,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:58,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:58,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:58,587 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:58,587 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-10-03 09:02:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,963 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-10-03 09:02:58,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:58,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-03 09:02:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,967 INFO L225 Difference]: With dead ends: 880 [2018-10-03 09:02:58,967 INFO L226 Difference]: Without dead ends: 542 [2018-10-03 09:02:58,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-03 09:02:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-10-03 09:02:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-03 09:02:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-10-03 09:02:58,993 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-10-03 09:02:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,995 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-10-03 09:02:58,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-10-03 09:02:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-03 09:02:58,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,999 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-03 09:02:59,000 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:59,000 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-10-03 09:02:59,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,211 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-03 09:02:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:02:59,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:02:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:02:59,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:59,213 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-10-03 09:02:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:59,385 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-10-03 09:02:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:59,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-03 09:02:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:59,394 INFO L225 Difference]: With dead ends: 1096 [2018-10-03 09:02:59,394 INFO L226 Difference]: Without dead ends: 731 [2018-10-03 09:02:59,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-03 09:02:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-03 09:02:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-10-03 09:02:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-03 09:02:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-10-03 09:02:59,425 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-10-03 09:02:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:59,426 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-10-03 09:02:59,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:02:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-10-03 09:02:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-03 09:02:59,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:59,428 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-03 09:02:59,429 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:02:59,429 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-10-03 09:02:59,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:59,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:59,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,822 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-03 09:02:59,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:02:59,823 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-03 09:02:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:00,597 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-03 09:03:00,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:00,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-03 09:03:00,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:03:00,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:03:00,638 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:00,641 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-10-03 09:03:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:01,364 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-10-03 09:03:01,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:03:01,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-03 09:03:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:01,372 INFO L225 Difference]: With dead ends: 1293 [2018-10-03 09:03:01,373 INFO L226 Difference]: Without dead ends: 1292 [2018-10-03 09:03:01,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.1s impTime 6 [2018-10-03 09:03:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-03 09:03:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-10-03 09:03:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-03 09:03:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-10-03 09:03:01,423 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-10-03 09:03:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:01,424 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-10-03 09:03:01,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:03:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-10-03 09:03:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-03 09:03:01,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:01,428 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-03 09:03:01,428 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:01,429 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-10-03 09:03:01,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:01,563 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-03 09:03:01,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:01,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:01,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:03:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:03:01,566 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:01,566 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-10-03 09:03:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:01,877 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-10-03 09:03:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:03:01,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-03 09:03:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:01,888 INFO L225 Difference]: With dead ends: 2655 [2018-10-03 09:03:01,888 INFO L226 Difference]: Without dead ends: 1510 [2018-10-03 09:03:01,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-03 09:03:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-03 09:03:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-10-03 09:03:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-10-03 09:03:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-10-03 09:03:01,950 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-10-03 09:03:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:01,951 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-10-03 09:03:01,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:03:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-10-03 09:03:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-03 09:03:01,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:01,954 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-03 09:03:01,954 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:01,956 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-10-03 09:03:01,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:02,158 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-03 09:03:02,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:02,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:02,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:03:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:03:02,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:02,162 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-10-03 09:03:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:02,336 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-10-03 09:03:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:02,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-03 09:03:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:02,349 INFO L225 Difference]: With dead ends: 2726 [2018-10-03 09:03:02,350 INFO L226 Difference]: Without dead ends: 1469 [2018-10-03 09:03:02,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-03 09:03:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-03 09:03:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-10-03 09:03:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-10-03 09:03:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-10-03 09:03:02,414 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-10-03 09:03:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:02,415 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-10-03 09:03:02,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:03:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-10-03 09:03:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-03 09:03:02,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:02,418 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-03 09:03:02,418 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:02,420 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-10-03 09:03:02,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:02,522 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-03 09:03:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:02,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:02,523 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-10-03 09:03:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:02,803 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-10-03 09:03:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:02,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-03 09:03:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:02,812 INFO L225 Difference]: With dead ends: 2942 [2018-10-03 09:03:02,812 INFO L226 Difference]: Without dead ends: 1457 [2018-10-03 09:03:02,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-03 09:03:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-10-03 09:03:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-10-03 09:03:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-10-03 09:03:02,870 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-10-03 09:03:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:02,871 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-10-03 09:03:02,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-10-03 09:03:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-03 09:03:02,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:02,874 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-03 09:03:02,874 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:02,874 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:02,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-10-03 09:03:02,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:02,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:02,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:02,976 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-03 09:03:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:02,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:02,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:02,978 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-10-03 09:03:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:03,050 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-10-03 09:03:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:03,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-03 09:03:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:03,066 INFO L225 Difference]: With dead ends: 3297 [2018-10-03 09:03:03,066 INFO L226 Difference]: Without dead ends: 1830 [2018-10-03 09:03:03,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-03 09:03:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-10-03 09:03:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-10-03 09:03:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-10-03 09:03:03,128 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-10-03 09:03:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:03,128 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-10-03 09:03:03,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-10-03 09:03:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-03 09:03:03,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:03,132 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-03 09:03:03,132 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:03,132 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-10-03 09:03:03,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:03,973 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-03 09:03:03,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:03,974 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-03 09:03:03,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:04,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:06,545 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-03 09:03:06,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:06,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-03 09:03:06,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:06,568 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:06,569 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 14 states. [2018-10-03 09:03:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:07,749 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-10-03 09:03:07,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:03:07,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-10-03 09:03:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:07,763 INFO L225 Difference]: With dead ends: 3128 [2018-10-03 09:03:07,764 INFO L226 Difference]: Without dead ends: 3127 [2018-10-03 09:03:07,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 0.8s impTime 12 [2018-10-03 09:03:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-10-03 09:03:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-10-03 09:03:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-03 09:03:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-10-03 09:03:07,827 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-10-03 09:03:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:07,827 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-10-03 09:03:07,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:03:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-10-03 09:03:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-03 09:03:07,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:07,832 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-03 09:03:07,832 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:07,832 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-10-03 09:03:07,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:07,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:07,922 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-03 09:03:07,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:07,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:07,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:07,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:07,924 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-10-03 09:03:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:08,206 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-10-03 09:03:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:08,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-03 09:03:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:08,212 INFO L225 Difference]: With dead ends: 2399 [2018-10-03 09:03:08,212 INFO L226 Difference]: Without dead ends: 1130 [2018-10-03 09:03:08,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-03 09:03:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-10-03 09:03:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-10-03 09:03:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-10-03 09:03:08,259 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-10-03 09:03:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:08,260 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-10-03 09:03:08,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-10-03 09:03:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-03 09:03:08,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:08,263 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-03 09:03:08,263 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:08,264 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-10-03 09:03:08,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:08,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:08,335 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-03 09:03:08,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:08,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:08,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:08,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:08,337 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-10-03 09:03:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:08,638 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-10-03 09:03:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:08,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-03 09:03:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:08,642 INFO L225 Difference]: With dead ends: 2013 [2018-10-03 09:03:08,642 INFO L226 Difference]: Without dead ends: 850 [2018-10-03 09:03:08,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-10-03 09:03:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-10-03 09:03:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-03 09:03:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-10-03 09:03:08,672 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-10-03 09:03:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:08,672 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-10-03 09:03:08,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-10-03 09:03:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-03 09:03:08,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:08,674 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-03 09:03:08,675 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:08,675 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-10-03 09:03:08,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:08,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:08,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:08,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:08,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:08,801 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-03 09:03:08,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:08,802 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-03 09:03:08,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:08,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:08,954 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-03 09:03:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-10-03 09:03:08,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:03:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:03:08,981 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:08,981 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-10-03 09:03:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:09,694 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-10-03 09:03:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 09:03:09,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-03 09:03:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:09,698 INFO L225 Difference]: With dead ends: 1537 [2018-10-03 09:03:09,699 INFO L226 Difference]: Without dead ends: 1017 [2018-10-03 09:03:09,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-03 09:03:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-03 09:03:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-10-03 09:03:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-10-03 09:03:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-10-03 09:03:09,731 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-10-03 09:03:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:09,731 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-10-03 09:03:09,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:03:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-10-03 09:03:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-03 09:03:09,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:09,734 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-03 09:03:09,734 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:09,734 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-10-03 09:03:09,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:09,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:09,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:09,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:09,826 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-03 09:03:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:09,827 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-03 09:03:09,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:09,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:10,048 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-03 09:03:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 09:03:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-03 09:03:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:03:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:03:10,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:10,081 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-10-03 09:03:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:10,218 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-10-03 09:03:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:03:10,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-03 09:03:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:10,220 INFO L225 Difference]: With dead ends: 1396 [2018-10-03 09:03:10,220 INFO L226 Difference]: Without dead ends: 661 [2018-10-03 09:03:10,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 3 [2018-10-03 09:03:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-03 09:03:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-10-03 09:03:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-03 09:03:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-10-03 09:03:10,251 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-10-03 09:03:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:10,252 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-10-03 09:03:10,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:03:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-10-03 09:03:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-03 09:03:10,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:10,254 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-03 09:03:10,254 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:10,255 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-10-03 09:03:10,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:10,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:10,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:10,352 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-03 09:03:10,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:10,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:10,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:10,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:10,354 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-10-03 09:03:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:10,514 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-10-03 09:03:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:10,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-03 09:03:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:10,517 INFO L225 Difference]: With dead ends: 1306 [2018-10-03 09:03:10,517 INFO L226 Difference]: Without dead ends: 667 [2018-10-03 09:03:10,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-03 09:03:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-10-03 09:03:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-03 09:03:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-10-03 09:03:10,549 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-10-03 09:03:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:10,550 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-10-03 09:03:10,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-10-03 09:03:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-03 09:03:10,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:10,553 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-03 09:03:10,554 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:10,554 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-10-03 09:03:10,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:10,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:10,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:10,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:10,714 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-03 09:03:10,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:03:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:03:10,716 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:10,716 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-10-03 09:03:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:10,776 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-10-03 09:03:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:03:10,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-03 09:03:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:10,778 INFO L225 Difference]: With dead ends: 930 [2018-10-03 09:03:10,778 INFO L226 Difference]: Without dead ends: 336 [2018-10-03 09:03:10,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-03 09:03:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-03 09:03:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-10-03 09:03:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-03 09:03:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-10-03 09:03:10,793 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-10-03 09:03:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:10,793 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-10-03 09:03:10,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:03:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-10-03 09:03:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-03 09:03:10,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:10,795 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-03 09:03:10,795 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:10,795 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:10,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-10-03 09:03:10,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:10,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:10,884 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-03 09:03:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:10,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:10,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:10,886 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-10-03 09:03:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:11,294 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-10-03 09:03:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:11,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-03 09:03:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:11,297 INFO L225 Difference]: With dead ends: 663 [2018-10-03 09:03:11,297 INFO L226 Difference]: Without dead ends: 335 [2018-10-03 09:03:11,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-03 09:03:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-10-03 09:03:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-03 09:03:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-10-03 09:03:11,314 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-10-03 09:03:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-10-03 09:03:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-10-03 09:03:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-03 09:03:11,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:11,316 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-03 09:03:11,317 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:11,317 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-10-03 09:03:11,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:12,022 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-03 09:03:12,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:12,022 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-03 09:03:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:03:12,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:03:12,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:03:12,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:12,802 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-03 09:03:12,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:12,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-03 09:03:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:03:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:03:12,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:12,824 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 18 states. [2018-10-03 09:03:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:14,200 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-10-03 09:03:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:03:14,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-10-03 09:03:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:14,207 INFO L225 Difference]: With dead ends: 1064 [2018-10-03 09:03:14,208 INFO L226 Difference]: Without dead ends: 1063 [2018-10-03 09:03:14,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.5s impTime 18 [2018-10-03 09:03:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-03 09:03:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-10-03 09:03:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-03 09:03:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-10-03 09:03:14,232 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-10-03 09:03:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:14,232 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-10-03 09:03:14,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:03:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-10-03 09:03:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-03 09:03:14,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:14,234 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-03 09:03:14,234 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:14,235 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-10-03 09:03:14,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:14,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:14,333 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-03 09:03:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 09:03:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:03:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:03:14,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:14,334 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-10-03 09:03:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:14,401 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-10-03 09:03:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 09:03:14,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-03 09:03:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:14,403 INFO L225 Difference]: With dead ends: 673 [2018-10-03 09:03:14,403 INFO L226 Difference]: Without dead ends: 468 [2018-10-03 09:03:14,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-03 09:03:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-03 09:03:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-10-03 09:03:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-03 09:03:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-10-03 09:03:14,423 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-10-03 09:03:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:14,424 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-10-03 09:03:14,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:03:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-10-03 09:03:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-03 09:03:14,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:14,425 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-03 09:03:14,426 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:14,426 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-10-03 09:03:14,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:14,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:14,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:14,590 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-03 09:03:14,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:14,590 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-03 09:03:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:14,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:15,064 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-03 09:03:15,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:15,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-03 09:03:15,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 09:03:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 09:03:15,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:15,086 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 10 states. [2018-10-03 09:03:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:15,356 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-10-03 09:03:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:03:15,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-10-03 09:03:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:15,360 INFO L225 Difference]: With dead ends: 845 [2018-10-03 09:03:15,360 INFO L226 Difference]: Without dead ends: 844 [2018-10-03 09:03:15,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 9 [2018-10-03 09:03:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-03 09:03:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-10-03 09:03:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-03 09:03:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-10-03 09:03:15,397 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-10-03 09:03:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:15,398 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-10-03 09:03:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 09:03:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-10-03 09:03:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-03 09:03:15,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:15,400 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-03 09:03:15,400 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:15,400 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-10-03 09:03:15,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:15,501 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-03 09:03:15,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:15,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:15,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:15,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:15,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:15,502 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-10-03 09:03:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:15,838 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-10-03 09:03:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:15,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-03 09:03:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:15,841 INFO L225 Difference]: With dead ends: 1086 [2018-10-03 09:03:15,841 INFO L226 Difference]: Without dead ends: 479 [2018-10-03 09:03:15,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-03 09:03:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-10-03 09:03:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-03 09:03:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-10-03 09:03:15,869 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-10-03 09:03:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:15,870 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-10-03 09:03:15,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-10-03 09:03:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-03 09:03:15,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:15,871 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-03 09:03:15,871 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-03 09:03:15,872 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-10-03 09:03:15,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:15,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:15,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:16,563 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-03 09:03:16,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:16,563 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-03 09:03:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:16,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:17,372 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-03 09:03:17,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-10-03 09:03:17,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 09:03:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 09:03:17,393 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:17,394 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-10-03 09:03:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:19,046 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-10-03 09:03:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 09:03:19,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-10-03 09:03:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:19,047 INFO L225 Difference]: With dead ends: 970 [2018-10-03 09:03:19,047 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:03:19,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.9s impTime 19 [2018-10-03 09:03:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:03:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:03:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:03:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:03:19,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-10-03 09:03:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:19,049 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:03:19,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 09:03:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:03:19,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:03:19,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:03:19,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:19,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:19,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:21,290 WARN L178 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 666 DAG size of output: 594 [2018-10-03 09:03:29,489 WARN L178 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 571 DAG size of output: 162 [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-10-03 09:03:29,495 INFO L425 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-10-03 09:03:29,496 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-03 09:03:29,497 INFO L421 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse44 (+ Elevator_dir Elevator_goal))) (let ((.cse34 (<= Elevator_min Elevator_current)) (.cse35 (<= Elevator_current Elevator_max)) (.cse27 (<= .cse44 (+ Elevator_max 1))) (.cse32 (+ Elevator_dir Elevator_current)) (.cse47 (+ Elevator_dir 1)) (.cse48 (= Elevator_current Elevator_goal))) (let ((.cse45 (= Elevator_dir 1)) (.cse4 (not Elevator_stop)) (.cse21 (not .cse48)) (.cse6 (= Elevator_qDC2 2)) (.cse17 (<= Elevator_qDC1 1)) (.cse22 (not Elevator_passed)) (.cse46 (= .cse47 0)) (.cse40 (<= (+ Elevator_min 2) .cse32)) (.cse42 (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2))) (.cse9 (not (= Elevator_goal Elevator_current))) (.cse43 (<= Elevator_current (+ Elevator_dir Elevator_min))) (.cse33 (and (<= .cse32 Elevator_goal) .cse27)) (.cse5 (= Elevator_qDC1 2)) (.cse7 (and .cse34 .cse35)) (.cse41 (<= Elevator_goal Elevator_current)) (.cse29 (= Elevator_qCSP 1)) (.cse37 (= Elevator_qCSP 3))) (let ((.cse30 (= Elevator_qDC2 1)) (.cse15 (not .cse37)) (.cse18 (not .cse29)) (.cse19 (or .cse41 (<= Elevator_dir 1))) (.cse16 (= Elevator_min Elevator_current)) (.cse31 (and .cse5 .cse7 .cse29)) (.cse14 (not (= Elevator_min Elevator_goal))) (.cse20 (or (<= .cse47 0) .cse48 .cse33)) (.cse12 (or .cse40 (and .cse41 (and .cse42 .cse9)) .cse43)) (.cse0 (or (<= Elevator_current Elevator_goal) .cse46)) (.cse38 (and .cse4 (and .cse21 .cse6 .cse7 .cse17 .cse22))) (.cse11 (or .cse41 .cse45)) (.cse23 (or (<= Elevator_current .cse44) .cse46)) (.cse24 (or (and (<= (+ Elevator_current 1) Elevator_max) .cse34) (and .cse35 (<= (+ Elevator_min 1) Elevator_current)))) (.cse25 (not (= .cse44 Elevator_current))) (.cse26 (or (<= .cse44 Elevator_current) .cse45)) (.cse3 (<= Elevator_c2 2)) (.cse8 (not Elevator_newgoal)) (.cse10 (<= Elevator_c2 Elevator_c3)) (.cse36 (= Elevator_qDC2 3)) (.cse1 (<= Elevator_goal Elevator_max)) (.cse2 (<= Elevator_min Elevator_goal)) (.cse28 (or .cse40 (and .cse41 (or .cse42 (< Elevator_current (+ Elevator_goal 1)))) .cse43)) (.cse13 (not Elevator_start))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and (and .cse4 (and .cse5 .cse6 .cse7)) .cse8) .cse9 .cse10) .cse11 .cse12 .cse13) (and (and .cse4 .cse10 (and .cse6 (and .cse14 (and .cse15 .cse16 .cse17)) .cse1) .cse18) .cse19 .cse20 .cse12 .cse13) (and (and .cse10 (and (and .cse4 (and .cse21 .cse15 .cse6 .cse7 .cse17 .cse22)) .cse18)) .cse1 .cse2 .cse13) (and .cse23 .cse24 .cse25 .cse2 .cse26 .cse27 .cse28 (and .cse10 (and (and .cse29 .cse17 .cse22) .cse30 .cse8)) .cse13) (and .cse23 .cse24 .cse25 .cse26 (and .cse3 .cse10 .cse1 .cse2 (and .cse31 .cse30 .cse8)) .cse28 .cse13) (and (and (and .cse30 (and .cse10 (and .cse16 .cse17 .cse29))) .cse1) .cse19 (<= Elevator_min .cse32) (or .cse9 (<= (+ Elevator_dir Elevator_current 1) Elevator_max)) .cse33) (and .cse3 .cse34 .cse35 .cse10 (and .cse4 .cse21 .cse5 .cse15 .cse6 .cse18) .cse1 .cse2 .cse13) (and .cse19 (and (and .cse4 .cse10 (and .cse6 (and .cse14 .cse16 .cse17 .cse29)) .cse8) .cse1 .cse2) .cse12 .cse13) (and .cse10 (and .cse4 .cse31 .cse36) .cse22) (and .cse0 (and (and .cse3 (and (and .cse4 (and .cse21 .cse5 .cse6 .cse7)) .cse8 .cse37)) .cse1 .cse2) .cse11) (and .cse4 .cse10 .cse5 (and .cse21 .cse7) .cse36 .cse22) (and (and .cse14 .cse8 .cse17 .cse4 .cse10 (= Elevator_current Elevator_min) .cse6 .cse37) .cse11 .cse20 .cse12) (and .cse0 (and .cse10 (and .cse38 .cse8) .cse1 .cse2) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (and .cse38 .cse8 .cse37) .cse11) (and .cse23 .cse24 .cse25 .cse26 (and (and .cse3 (and .cse8 (let ((.cse39 (and .cse4 (and .cse5 .cse7) .cse36))) (or (and (<= 0 Elevator_c3) .cse39 (<= Elevator_c2 0)) (and .cse10 .cse39 .cse22))) .cse37)) .cse1 .cse2) .cse28 .cse13)))))) [2018-10-03 09:03:29,497 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-03 09:03:29,497 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-10-03 09:03:29,498 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-10-03 09:03:29,499 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-10-03 09:03:29,499 INFO L425 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-10-03 09:03:29,499 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-10-03 09:03:29,499 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-10-03 09:03:29,499 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-10-03 09:03:29,521 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:03:29 BoogieIcfgContainer [2018-10-03 09:03:29,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:03:29,523 INFO L168 Benchmark]: Toolchain (without parser) took 33858.71 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.2 MB). Free memory was 1.5 GB in the beginning and 927.9 MB in the end (delta: 537.8 MB). Peak memory consumption was 931.8 MB. Max. memory is 7.1 GB. [2018-10-03 09:03:29,524 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-03 09:03:29,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:03:29,525 INFO L168 Benchmark]: Boogie Preprocessor took 54.96 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-03 09:03:29,526 INFO L168 Benchmark]: RCFGBuilder took 686.37 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-03 09:03:29,527 INFO L168 Benchmark]: TraceAbstraction took 33062.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.2 MB). Free memory was 1.4 GB in the beginning and 927.9 MB in the end (delta: 506.1 MB). Peak memory consumption was 900.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:03:29,532 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.24 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 47.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.96 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 686.37 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 33062.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.2 MB). Free memory was 1.4 GB in the beginning and 927.9 MB in the end (delta: 506.1 MB). Peak memory consumption was 900.1 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: ((((((((((((((((((((current <= goal || dir + 1 == 0) && goal <= max) && min <= goal) && ((c2 <= 2 && (!stop && (qDC1 == 2 && qDC2 == 2) && min <= current && current <= max) && !newgoal) && !(goal == current)) && c2 <= c3) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start) || (((((((!stop && c2 <= c3) && (qDC2 == 2 && !(min == goal) && (!(qCSP == 3) && min == current) && qDC1 <= 1) && goal <= max) && !(qCSP == 1)) && (goal <= current || dir <= 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || ((((c2 <= c3 && (!stop && ((((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || (((((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && min <= goal) && (dir + goal <= current || dir == 1)) && dir + goal <= max + 1) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && c2 <= c3 && (((qCSP == 1 && qDC1 <= 1) && !passed) && qDC2 == 1) && !newgoal) && !start)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && (((c2 <= 2 && c2 <= c3) && goal <= max) && min <= goal) && (((qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 1) && !newgoal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start)) || ((((((qDC2 == 1 && c2 <= c3 && (min == current && qDC1 <= 1) && qCSP == 1) && goal <= max) && (goal <= current || dir <= 1)) && min <= dir + current) && (!(goal == current) || dir + current + 1 <= max)) && dir + current <= goal && dir + goal <= max + 1)) || (((((((c2 <= 2 && min <= current) && current <= max) && c2 <= c3) && ((((!stop && !(current == goal)) && qDC1 == 2) && !(qCSP == 3)) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((goal <= current || dir <= 1) && ((((!stop && c2 <= c3) && qDC2 == 2 && ((!(min == goal) && min == current) && qDC1 <= 1) && qCSP == 1) && !newgoal) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || ((c2 <= c3 && (!stop && (qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 3) && !passed)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !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)) || ((((((((((!(min == goal) && !newgoal) && qDC1 <= 1) && !stop) && c2 <= c3) && current == min) && qDC2 == 2) && qCSP == 3) && (goal <= current || dir == 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min))) || (((((current <= goal || dir + 1 == 0) && ((c2 <= c3 && (!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((current <= goal || dir + 1 == 0) && goal <= max) && min <= goal) && ((!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && (goal <= current || dir == 1))) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && ((c2 <= 2 && (!newgoal && (((0 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && c2 <= 0) || ((c2 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && !passed))) && qCSP == 3) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 32.9s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 10.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4320 SDslu, 4596 SDs, 0 SdLazy, 2474 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 745 SyntacticMatches, 14 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s 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.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 1109 HoareAnnotationTreeSize, 1 FomulaSimplifications, 363350 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 342019 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 4736705 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-03-29-550.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-03-29-550.csv Received shutdown request...