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/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:03:14,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:14,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:14,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:14,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:14,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:14,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:14,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:14,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:14,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:14,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:14,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:14,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:14,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:14,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:14,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:14,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:14,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:14,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:14,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:14,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:15,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:15,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:15,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:15,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:15,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:15,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:15,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:15,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:15,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:15,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:15,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:15,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:15,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:15,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:15,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:15,012 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-02 12:03:15,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:15,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:15,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:15,029 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:15,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:15,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:15,030 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:15,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:15,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:15,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:15,032 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:15,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:15,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:15,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:15,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:15,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:15,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:15,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:15,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:15,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:15,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:15,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:15,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:15,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:15,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:15,035 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:15,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:15,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:15,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:15,118 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:15,119 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:15,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-10-02 12:03:15,120 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-10-02 12:03:15,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:15,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:15,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:15,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:15,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:15,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,231 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:03:15,231 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:03:15,232 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:03:15,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:15,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:15,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:15,235 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:15,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... [2018-10-02 12:03:15,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:15,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:15,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:15,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:15,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:15,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-02 12:03:15,344 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-02 12:03:15,345 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-02 12:03:16,017 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:03:16,018 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:16 BoogieIcfgContainer [2018-10-02 12:03:16,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:16,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:16,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:16,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:16,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:15" (1/2) ... [2018-10-02 12:03:16,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7467c91 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:16, skipping insertion in model container [2018-10-02 12:03:16,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:16" (2/2) ... [2018-10-02 12:03:16,026 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-10-02 12:03:16,036 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:16,045 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:03:16,096 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:16,097 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:16,097 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:16,097 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:16,098 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:16,098 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:16,098 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:16,098 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:16,098 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-02 12:03:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:16,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:16,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:16,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:16,134 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-10-02 12:03:16,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:16,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:03:16,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:16,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:16,310 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-02 12:03:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:16,575 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-10-02 12:03:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:16,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-02 12:03:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:16,592 INFO L225 Difference]: With dead ends: 85 [2018-10-02 12:03:16,593 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 12:03:16,596 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 [2018-10-02 12:03:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 12:03:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-02 12:03:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 12:03:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-10-02 12:03:16,649 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-10-02 12:03:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-10-02 12:03:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-10-02 12:03:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:16,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:16,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:16,651 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:16,652 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-10-02 12:03:16,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:03:16,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:16,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:16,737 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-10-02 12:03:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:17,213 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-10-02 12:03:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:17,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-02 12:03:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:17,216 INFO L225 Difference]: With dead ends: 154 [2018-10-02 12:03:17,216 INFO L226 Difference]: Without dead ends: 95 [2018-10-02 12:03:17,218 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 [2018-10-02 12:03:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-02 12:03:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-02 12:03:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-02 12:03:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-10-02 12:03:17,236 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-10-02 12:03:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:17,236 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-10-02 12:03:17,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-10-02 12:03:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:17,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:17,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:17,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:17,241 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-10-02 12:03:17,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:17,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:17,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:17,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:17,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:17,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:17,314 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-10-02 12:03:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:17,952 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-10-02 12:03:17,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:17,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-02 12:03:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:17,957 INFO L225 Difference]: With dead ends: 233 [2018-10-02 12:03:17,957 INFO L226 Difference]: Without dead ends: 136 [2018-10-02 12:03:17,958 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 [2018-10-02 12:03:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-02 12:03:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-10-02 12:03:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-02 12:03:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-10-02 12:03:17,977 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-10-02 12:03:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:17,978 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-10-02 12:03:17,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-10-02 12:03:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:17,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:17,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:17,982 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:17,982 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-10-02 12:03:17,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:17,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:17,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:03:18,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:03:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:03:18,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:18,102 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-10-02 12:03:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:18,700 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-10-02 12:03:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:03:18,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-02 12:03:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:18,704 INFO L225 Difference]: With dead ends: 144 [2018-10-02 12:03:18,704 INFO L226 Difference]: Without dead ends: 143 [2018-10-02 12:03:18,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-02 12:03:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-02 12:03:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-02 12:03:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-10-02 12:03:18,720 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-10-02 12:03:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:18,720 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-10-02 12:03:18,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:03:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-10-02 12:03:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:03:18,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:18,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:18,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:18,722 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-10-02 12:03:18,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:18,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:18,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:18,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:18,796 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-10-02 12:03:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:19,217 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-10-02 12:03:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:03:19,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-02 12:03:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:19,222 INFO L225 Difference]: With dead ends: 459 [2018-10-02 12:03:19,222 INFO L226 Difference]: Without dead ends: 286 [2018-10-02 12:03:19,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-02 12:03:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-10-02 12:03:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-02 12:03:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-10-02 12:03:19,260 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-10-02 12:03:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:19,261 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-10-02 12:03:19,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-10-02 12:03:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-02 12:03:19,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:19,271 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:19,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:19,271 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-10-02 12:03:19,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:19,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-02 12:03:19,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:19,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:19,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:19,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:19,339 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-10-02 12:03:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:19,874 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-10-02 12:03:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:19,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-02 12:03:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:19,880 INFO L225 Difference]: With dead ends: 695 [2018-10-02 12:03:19,880 INFO L226 Difference]: Without dead ends: 402 [2018-10-02 12:03:19,883 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 [2018-10-02 12:03:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-02 12:03:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-10-02 12:03:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-02 12:03:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-10-02 12:03:19,901 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-10-02 12:03:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:19,902 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-10-02 12:03:19,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-10-02 12:03:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 12:03:19,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:19,904 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:19,904 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:19,905 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-10-02 12:03:19,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:19,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:03:19,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:19,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:19,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:19,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:19,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:19,960 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-10-02 12:03:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:20,137 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-10-02 12:03:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:20,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 12:03:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:20,148 INFO L225 Difference]: With dead ends: 711 [2018-10-02 12:03:20,148 INFO L226 Difference]: Without dead ends: 414 [2018-10-02 12:03:20,149 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 [2018-10-02 12:03:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-02 12:03:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-10-02 12:03:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-02 12:03:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-10-02 12:03:20,164 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-10-02 12:03:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:20,165 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-10-02 12:03:20,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-10-02 12:03:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-02 12:03:20,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:20,168 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:20,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:20,168 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:20,168 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-10-02 12:03:20,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:20,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:20,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-02 12:03:20,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:20,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:03:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:20,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-02 12:03:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:03:20,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-02 12:03:20,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:20,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:20,578 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-10-02 12:03:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:21,419 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-10-02 12:03:21,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:03:21,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-02 12:03:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:21,430 INFO L225 Difference]: With dead ends: 834 [2018-10-02 12:03:21,430 INFO L226 Difference]: Without dead ends: 523 [2018-10-02 12:03:21,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:03:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-02 12:03:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-10-02 12:03:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-02 12:03:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-10-02 12:03:21,460 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-10-02 12:03:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:21,461 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-10-02 12:03:21,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-10-02 12:03:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 12:03:21,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:21,471 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-02 12:03:21,471 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:21,471 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-10-02 12:03:21,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:21,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:21,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-02 12:03:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:21,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:21,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:21,637 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-10-02 12:03:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:22,238 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-10-02 12:03:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:22,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-02 12:03:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:22,245 INFO L225 Difference]: With dead ends: 1110 [2018-10-02 12:03:22,245 INFO L226 Difference]: Without dead ends: 657 [2018-10-02 12:03:22,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-02 12:03:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-10-02 12:03:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-02 12:03:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-10-02 12:03:22,270 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-10-02 12:03:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:22,271 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-10-02 12:03:22,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-10-02 12:03:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 12:03:22,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:22,273 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-02 12:03:22,274 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:22,274 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-10-02 12:03:22,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:03:22,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:22,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:22,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:22,343 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:22,343 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-10-02 12:03:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:22,572 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-10-02 12:03:22,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:22,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-02 12:03:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:22,578 INFO L225 Difference]: With dead ends: 1308 [2018-10-02 12:03:22,579 INFO L226 Difference]: Without dead ends: 655 [2018-10-02 12:03:22,580 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 [2018-10-02 12:03:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-10-02 12:03:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-10-02 12:03:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-02 12:03:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-10-02 12:03:22,607 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-10-02 12:03:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:22,607 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-10-02 12:03:22,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-10-02 12:03:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 12:03:22,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:22,609 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-02 12:03:22,609 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:22,610 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-10-02 12:03:22,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:22,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:22,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:23,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:23,034 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:03:23,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:23,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:24,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:24,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-02 12:03:24,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:03:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:03:24,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:24,701 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-10-02 12:03:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:29,511 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-10-02 12:03:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:03:29,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-10-02 12:03:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:29,521 INFO L225 Difference]: With dead ends: 2731 [2018-10-02 12:03:29,522 INFO L226 Difference]: Without dead ends: 2018 [2018-10-02 12:03:29,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 1.3s impTime [2018-10-02 12:03:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-10-02 12:03:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-10-02 12:03:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-10-02 12:03:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-10-02 12:03:29,584 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-10-02 12:03:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:29,586 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-10-02 12:03:29,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:03:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-10-02 12:03:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-02 12:03:29,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:29,589 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:29,589 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:29,591 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-10-02 12:03:29,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:29,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-02 12:03:29,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:29,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:29,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:03:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:03:29,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:29,799 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-10-02 12:03:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:30,052 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-10-02 12:03:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:30,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-02 12:03:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:30,057 INFO L225 Difference]: With dead ends: 1832 [2018-10-02 12:03:30,058 INFO L226 Difference]: Without dead ends: 917 [2018-10-02 12:03:30,059 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 [2018-10-02 12:03:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-02 12:03:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-10-02 12:03:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-02 12:03:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-10-02 12:03:30,106 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-10-02 12:03:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:30,107 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-10-02 12:03:30,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:03:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-10-02 12:03:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 12:03:30,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:30,109 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:30,109 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:30,109 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-10-02 12:03:30,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-02 12:03:30,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:30,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:30,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:30,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:30,179 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-10-02 12:03:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:30,340 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-10-02 12:03:30,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:30,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-02 12:03:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:30,345 INFO L225 Difference]: With dead ends: 1833 [2018-10-02 12:03:30,345 INFO L226 Difference]: Without dead ends: 852 [2018-10-02 12:03:30,346 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 [2018-10-02 12:03:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-10-02 12:03:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-10-02 12:03:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-10-02 12:03:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-10-02 12:03:30,389 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-10-02 12:03:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:30,389 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-10-02 12:03:30,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-10-02 12:03:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-02 12:03:30,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:30,393 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:30,393 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:30,393 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-10-02 12:03:30,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:30,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:03:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:03:30,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:30,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:03:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:31,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 117 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:31,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:31,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-02 12:03:31,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 12:03:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 12:03:31,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:31,999 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 29 states. [2018-10-02 12:03:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:41,255 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-10-02 12:03:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 12:03:41,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-10-02 12:03:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:41,263 INFO L225 Difference]: With dead ends: 2306 [2018-10-02 12:03:41,263 INFO L226 Difference]: Without dead ends: 2305 [2018-10-02 12:03:41,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 1.4s impTime [2018-10-02 12:03:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-10-02 12:03:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-10-02 12:03:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-02 12:03:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-10-02 12:03:41,341 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-10-02 12:03:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:41,342 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-10-02 12:03:41,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 12:03:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-10-02 12:03:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-02 12:03:41,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:41,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:41,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:41,345 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-10-02 12:03:41,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:41,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:41,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-02 12:03:41,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:41,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:41,469 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-10-02 12:03:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:41,788 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-10-02 12:03:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:41,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-02 12:03:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:41,791 INFO L225 Difference]: With dead ends: 1902 [2018-10-02 12:03:41,791 INFO L226 Difference]: Without dead ends: 952 [2018-10-02 12:03:41,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-02 12:03:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-10-02 12:03:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-02 12:03:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-10-02 12:03:41,863 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-10-02 12:03:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:41,863 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-10-02 12:03:41,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-10-02 12:03:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-02 12:03:41,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:41,866 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:41,866 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:41,867 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-10-02 12:03:41,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:41,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-02 12:03:41,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:41,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:41,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:41,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:41,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:41,973 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-10-02 12:03:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:42,297 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-10-02 12:03:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:42,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-02 12:03:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:42,300 INFO L225 Difference]: With dead ends: 1560 [2018-10-02 12:03:42,300 INFO L226 Difference]: Without dead ends: 640 [2018-10-02 12:03:42,301 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 [2018-10-02 12:03:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-10-02 12:03:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-10-02 12:03:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-02 12:03:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-10-02 12:03:42,341 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-10-02 12:03:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:42,342 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-10-02 12:03:42,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-10-02 12:03:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-02 12:03:42,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:42,344 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:42,344 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:42,344 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-10-02 12:03:42,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-02 12:03:42,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:42,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:03:42,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:42,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-02 12:03:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:43,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-02 12:03:43,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:43,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:43,339 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-10-02 12:03:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:43,605 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-10-02 12:03:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:03:43,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-10-02 12:03:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:43,608 INFO L225 Difference]: With dead ends: 1394 [2018-10-02 12:03:43,608 INFO L226 Difference]: Without dead ends: 724 [2018-10-02 12:03:43,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.2s impTime [2018-10-02 12:03:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-02 12:03:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-10-02 12:03:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-02 12:03:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-10-02 12:03:43,641 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-10-02 12:03:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:43,641 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-10-02 12:03:43,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-10-02 12:03:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-02 12:03:43,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:43,643 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:43,643 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:43,643 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-10-02 12:03:43,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-02 12:03:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:43,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:03:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:03:43,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:43,689 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-10-02 12:03:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:43,800 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-10-02 12:03:43,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:03:43,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-02 12:03:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:43,801 INFO L225 Difference]: With dead ends: 566 [2018-10-02 12:03:43,801 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:03:43,802 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 [2018-10-02 12:03:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:03:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:03:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:03:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:03:43,802 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-10-02 12:03:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:43,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:03:43,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:03:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:03:43,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:03:43,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:03:43,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:43,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:44,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:44,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:03:45,807 WARN L178 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 547 DAG size of output: 474 [2018-10-02 12:03:50,042 WARN L178 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 457 DAG size of output: 114 [2018-10-02 12:03:50,046 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-10-02 12:03:50,046 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-10-02 12:03:50,046 INFO L425 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-10-02 12:03:50,047 INFO L425 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-10-02 12:03:50,048 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-10-02 12:03:50,048 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-10-02 12:03:50,048 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-10-02 12:03:50,048 INFO L425 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse30 (+ |Elevator_goal'| 1))) (let ((.cse9 (< |Elevator_current'| |Elevator_goal'|)) (.cse10 (<= .cse30 |Elevator_current'|)) (.cse1 (<= Elevator_c2 Elevator_c3)) (.cse13 (<= |Elevator_current'| Elevator_max)) (.cse15 (<= Elevator_min |Elevator_current'|)) (.cse29 (<= |Elevator_goal'| |Elevator_current'|)) (.cse32 (<= |Elevator_current'| |Elevator_goal'|))) (let ((.cse23 (not Elevator_passed)) (.cse26 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse17 (not Elevator_newgoal)) (.cse24 (or (= (+ |Elevator_dir'| 1) 0) .cse32)) (.cse25 (or (= |Elevator_dir'| 1) .cse29)) (.cse7 (or (and .cse13 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse15))) (.cse14 (<= Elevator_qDC2 1)) (.cse22 (<= Elevator_qDC1 1)) (.cse2 (= Elevator_qDC2 3)) (.cse16 (= Elevator_qCSP 1)) (.cse0 (not Elevator_stop)) (.cse27 (or (<= Elevator_c2 2) .cse1)) (.cse3 (= Elevator_qDC1 2)) (.cse18 (or .cse9 .cse10)) (.cse19 (<= Elevator_qDC2 2)) (.cse4 (<= Elevator_min Elevator_current)) (.cse5 (<= Elevator_current Elevator_max)) (.cse21 (not (= Elevator_qCSP 3))) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse20 (<= 2 Elevator_qDC2)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse12 (<= Elevator_min Elevator_goal)) (.cse11 (<= Elevator_min |Elevator_goal'|))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and .cse4 .cse5 .cse6 .cse7) (or (and .cse8 .cse9) .cse10) .cse11 .cse12)) (and .cse1 (and (and .cse13 .cse4 .cse5 .cse14 .cse15 .cse16) .cse3 .cse8 .cse11 .cse6 .cse12) .cse17) (and .cse0 (and (and .cse18 .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse11)) (and (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse0 .cse5 .cse1 .cse3 .cse11) .cse17) (and (and .cse0 (and .cse24 (and .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse25 .cse11 .cse26)) .cse17) (and (and .cse0 .cse27 (and .cse24 .cse3 .cse25 (and .cse13 .cse19 .cse4 .cse20 .cse15 .cse8 .cse6 .cse12 .cse5 .cse11) .cse26)) .cse17) (and (let ((.cse28 (let ((.cse31 (let ((.cse33 (and .cse16 (and .cse13 .cse14 .cse15 .cse22)))) (or (and .cse32 .cse33 .cse29) (and .cse8 .cse11 .cse6 .cse12 .cse33))))) (or (and .cse24 .cse25 .cse7 .cse31) (and .cse4 .cse5 .cse6 .cse12 .cse31))))) (or (and .cse5 .cse28) (and .cse28 (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse29) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse30) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))))))) .cse1) (and .cse1 (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse16 .cse0 .cse5 .cse3 .cse11)) (and .cse0 .cse27 (and .cse3 (and .cse18 .cse19 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8) .cse20 .cse6 .cse12) .cse11)))))) [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-10-02 12:03:50,049 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-10-02 12:03:50,050 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-10-02 12:03:50,050 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-10-02 12:03:50,050 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-10-02 12:03:50,069 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:03:50 BoogieIcfgContainer [2018-10-02 12:03:50,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:03:50,070 INFO L168 Benchmark]: Toolchain (without parser) took 34883.65 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 380.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -270.8 MB). Peak memory consumption was 840.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:03:50,072 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:03:50,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:03:50,073 INFO L168 Benchmark]: Boogie Preprocessor took 31.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:03:50,074 INFO L168 Benchmark]: RCFGBuilder took 750.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:03:50,075 INFO L168 Benchmark]: TraceAbstraction took 34050.31 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 380.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -302.5 MB). Peak memory consumption was 809.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:03:50,080 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.69 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 31.44 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 750.94 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 34050.31 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 380.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -302.5 MB). Peak memory consumption was 809.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((!stop && c2 <= c3) && qDC2 == 3) && (((qDC1 == 2 && ((min <= current && current <= max) && goal <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && ((goal' <= max && current' < goal') || goal' + 1 <= current')) && min <= goal') && min <= goal) || ((c2 <= c3 && (((((((((current' <= max && min <= current) && current <= max) && qDC2 <= 1) && min <= current') && qCSP == 1) && qDC1 == 2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || (!stop && ((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && 2 <= qDC2) && ((((((((current' <= max && min <= current) && current <= max) && !(qCSP == 3)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && min <= goal')) || ((((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && !stop) && current <= max) && c2 <= c3) && qDC1 == 2) && min <= goal') && !newgoal)) || ((!stop && ((((dir' + 1 == 0 || current' <= goal') && (qDC2 <= 2 && 2 <= qDC2) && (((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && (dir' == 1 || goal' <= current')) && min <= goal') && !(current' == goal')) && !newgoal)) || (((!stop && (c2 <= 2 || c2 <= c3)) && ((((dir' + 1 == 0 || current' <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')) && ((((((((current' <= max && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && current <= max) && min <= goal') && !(current' == goal')) && !newgoal)) || (((current <= max && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))))) || ((((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1)))) && (((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir')))) && c2 <= c3)) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || ((!stop && (c2 <= 2 || c2 <= c3)) && (qDC1 == 2 && (((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && ((((current' <= max && min <= current) && current <= max) && !(qCSP == 3)) && min <= current') && goal' <= max) && 2 <= qDC2) && goal <= max) && min <= goal) && min <= goal') - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 20.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1968 SDslu, 2976 SDs, 0 SdLazy, 2047 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=14, 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.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 3363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 784 HoareAnnotationTreeSize, 1 FomulaSimplifications, 583815 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 351775 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 621580 SizeOfPredicates, 23 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1300/1473 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-03-50-097.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-03-50-097.csv Received shutdown request...