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-1cc990c [2018-09-30 20:34:07,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:07,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:07,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:07,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:07,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:07,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:07,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:07,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:07,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:07,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:07,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:07,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:07,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:07,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:07,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:07,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:07,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:07,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:07,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:07,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:07,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:07,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:07,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:07,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:07,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:07,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:07,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:07,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:07,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:07,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:07,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:07,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:07,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:07,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:07,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:07,628 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-09-30 20:34:07,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:07,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:07,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:07,658 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:07,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:07,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:07,659 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:07,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:07,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:07,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:07,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:07,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:07,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:07,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:07,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:07,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:07,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:07,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:07,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:07,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:07,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:07,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:07,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:07,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:07,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:07,665 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:07,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:07,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:07,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:07,744 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:07,745 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:07,745 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-09-30 20:34:07,746 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-09-30 20:34:07,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:07,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:07,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:07,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:07,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:07,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,868 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:07,868 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:07,869 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:07,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:07,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:07,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:07,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:07,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... [2018-09-30 20:34:07,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:07,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:07,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:07,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:07,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:07,982 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-30 20:34:07,982 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-30 20:34:07,983 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-30 20:34:08,731 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:08,731 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:08 BoogieIcfgContainer [2018-09-30 20:34:08,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:08,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:08,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:08,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:08,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:07" (1/2) ... [2018-09-30 20:34:08,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2692ff and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:08, skipping insertion in model container [2018-09-30 20:34:08,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:08" (2/2) ... [2018-09-30 20:34:08,740 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-09-30 20:34:08,749 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:08,761 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:34:08,813 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:08,813 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:08,814 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:08,814 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:08,814 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:08,814 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:08,814 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:08,815 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:08,815 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-30 20:34:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:08,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:08,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:08,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:08,847 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-09-30 20:34:08,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:08,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:08,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:09,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:09,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:34:09,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:09,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:09,026 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-30 20:34:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:09,223 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-09-30 20:34:09,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:09,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:34:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:09,239 INFO L225 Difference]: With dead ends: 85 [2018-09-30 20:34:09,240 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 20:34:09,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 20:34:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-30 20:34:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:34:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-09-30 20:34:09,287 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-09-30 20:34:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:09,287 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-09-30 20:34:09,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-09-30 20:34:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:09,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:09,289 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:09,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:09,289 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-09-30 20:34:09,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:09,391 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:09,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:34:09,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:09,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:09,394 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-09-30 20:34:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:09,819 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-09-30 20:34:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:09,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:34:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:09,822 INFO L225 Difference]: With dead ends: 154 [2018-09-30 20:34:09,822 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 20:34:09,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 20:34:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-30 20:34:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 20:34:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-09-30 20:34:09,850 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-09-30 20:34:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:09,854 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-09-30 20:34:09,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-09-30 20:34:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:09,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:09,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:09,856 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:09,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-09-30 20:34:09,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:09,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:09,909 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:09,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:09,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:09,911 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:09,911 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-09-30 20:34:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:10,458 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-09-30 20:34:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:10,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:34:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:10,461 INFO L225 Difference]: With dead ends: 233 [2018-09-30 20:34:10,461 INFO L226 Difference]: Without dead ends: 136 [2018-09-30 20:34:10,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-30 20:34:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-09-30 20:34:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-30 20:34:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-09-30 20:34:10,486 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-09-30 20:34:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:10,486 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-09-30 20:34:10,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-09-30 20:34:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:10,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:10,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:10,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:10,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-09-30 20:34:10,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:10,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:10,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:10,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:34:10,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:34:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:34:10,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:10,628 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-09-30 20:34:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:11,264 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-09-30 20:34:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:34:11,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-30 20:34:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:11,268 INFO L225 Difference]: With dead ends: 144 [2018-09-30 20:34:11,268 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 20:34:11,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 20:34:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-30 20:34:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-30 20:34:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-09-30 20:34:11,291 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-09-30 20:34:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:11,292 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-09-30 20:34:11,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:34:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-09-30 20:34:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:34:11,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:11,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:11,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:11,294 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-09-30 20:34:11,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:11,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:11,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:11,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:11,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:11,368 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-09-30 20:34:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:11,844 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-09-30 20:34:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:34:11,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-09-30 20:34:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:11,846 INFO L225 Difference]: With dead ends: 459 [2018-09-30 20:34:11,847 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 20:34:11,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 20:34:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-30 20:34:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 20:34:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-09-30 20:34:11,893 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-09-30 20:34:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:11,894 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-09-30 20:34:11,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-09-30 20:34:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:34:11,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:11,899 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-09-30 20:34:11,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:11,900 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-09-30 20:34:11,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:11,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:11,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-30 20:34:11,964 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:11,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:11,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:11,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:11,965 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-09-30 20:34:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:12,520 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-09-30 20:34:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:12,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-30 20:34:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:12,524 INFO L225 Difference]: With dead ends: 695 [2018-09-30 20:34:12,524 INFO L226 Difference]: Without dead ends: 402 [2018-09-30 20:34:12,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-30 20:34:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-09-30 20:34:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-30 20:34:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-09-30 20:34:12,545 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-09-30 20:34:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:12,546 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-09-30 20:34:12,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-09-30 20:34:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:34:12,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:12,548 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-09-30 20:34:12,549 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:12,549 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-09-30 20:34:12,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:34:12,604 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:12,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:12,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:12,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:12,606 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-09-30 20:34:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:12,780 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-09-30 20:34:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:12,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 20:34:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:12,791 INFO L225 Difference]: With dead ends: 711 [2018-09-30 20:34:12,791 INFO L226 Difference]: Without dead ends: 414 [2018-09-30 20:34:12,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-30 20:34:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-09-30 20:34:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-30 20:34:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-09-30 20:34:12,811 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-09-30 20:34:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:12,812 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-09-30 20:34:12,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-09-30 20:34:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:34:12,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:12,818 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-09-30 20:34:12,818 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:12,822 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-09-30 20:34:12,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:12,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:12,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 20:34:13,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:13,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:13,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-30 20:34:13,187 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:13,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-09-30 20:34:13,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:13,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:13,188 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-09-30 20:34:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:14,221 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-09-30 20:34:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:14,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-30 20:34:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:14,228 INFO L225 Difference]: With dead ends: 834 [2018-09-30 20:34:14,228 INFO L226 Difference]: Without dead ends: 523 [2018-09-30 20:34:14,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-30 20:34:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-09-30 20:34:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-30 20:34:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-09-30 20:34:14,266 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-09-30 20:34:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:14,266 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-09-30 20:34:14,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-09-30 20:34:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:34:14,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:14,269 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-09-30 20:34:14,269 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:14,274 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-09-30 20:34:14,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:14,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:14,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:14,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:14,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 20:34:14,443 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:14,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:14,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:14,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:14,445 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-09-30 20:34:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:14,896 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-09-30 20:34:14,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:14,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 20:34:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:14,902 INFO L225 Difference]: With dead ends: 1110 [2018-09-30 20:34:14,902 INFO L226 Difference]: Without dead ends: 657 [2018-09-30 20:34:14,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-09-30 20:34:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-09-30 20:34:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 20:34:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-09-30 20:34:14,928 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-09-30 20:34:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:14,928 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-09-30 20:34:14,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-09-30 20:34:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:34:14,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:14,931 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-09-30 20:34:14,931 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:14,931 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-09-30 20:34:14,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:14,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:14,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:34:15,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:15,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:15,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:15,034 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-09-30 20:34:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:15,464 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-09-30 20:34:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:15,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 20:34:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:15,470 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 20:34:15,471 INFO L226 Difference]: Without dead ends: 655 [2018-09-30 20:34:15,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-30 20:34:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-09-30 20:34:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 20:34:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-09-30 20:34:15,498 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-09-30 20:34:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:15,498 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-09-30 20:34:15,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-09-30 20:34:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:34:15,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:15,500 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-09-30 20:34:15,501 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:15,501 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-09-30 20:34:15,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:15,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:15,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:15,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:15,988 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:15,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:16,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:16,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:17,534 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:17,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 20:34:17,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:34:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:34:17,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:17,536 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-09-30 20:34:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:22,706 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-09-30 20:34:22,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:34:22,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-30 20:34:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:22,720 INFO L225 Difference]: With dead ends: 2731 [2018-09-30 20:34:22,720 INFO L226 Difference]: Without dead ends: 2018 [2018-09-30 20:34:22,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-09-30 20:34:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-09-30 20:34:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-09-30 20:34:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-30 20:34:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-09-30 20:34:22,779 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-09-30 20:34:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:22,780 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-09-30 20:34:22,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:34:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-09-30 20:34:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 20:34:22,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:22,784 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-09-30 20:34:22,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:22,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-09-30 20:34:22,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-30 20:34:22,896 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:22,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:22,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:34:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:34:22,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:22,897 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-09-30 20:34:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:23,045 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-09-30 20:34:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:23,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-30 20:34:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:23,049 INFO L225 Difference]: With dead ends: 1832 [2018-09-30 20:34:23,050 INFO L226 Difference]: Without dead ends: 917 [2018-09-30 20:34:23,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-09-30 20:34:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-09-30 20:34:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-09-30 20:34:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-09-30 20:34:23,098 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-09-30 20:34:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:23,098 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-09-30 20:34:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:34:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-09-30 20:34:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 20:34:23,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:23,101 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-09-30 20:34:23,102 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:23,102 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-09-30 20:34:23,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:23,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-30 20:34:23,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:23,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:23,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:23,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:23,217 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-09-30 20:34:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:23,569 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-09-30 20:34:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:23,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 20:34:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:23,573 INFO L225 Difference]: With dead ends: 1833 [2018-09-30 20:34:23,574 INFO L226 Difference]: Without dead ends: 852 [2018-09-30 20:34:23,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-30 20:34:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-09-30 20:34:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-30 20:34:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-09-30 20:34:23,620 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-09-30 20:34:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:23,620 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-09-30 20:34:23,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-09-30 20:34:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 20:34:23,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:23,625 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-09-30 20:34:23,625 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:23,625 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-09-30 20:34:23,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:23,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:34:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:34:25,044 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:25,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:25,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:25,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 117 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:26,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:26,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 20:34:26,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-30 20:34:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-30 20:34:26,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:26,022 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 29 states. [2018-09-30 20:34:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:41,729 INFO L93 Difference]: Finished difference Result 2448 states and 3113 transitions. [2018-09-30 20:34:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:34:41,729 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-09-30 20:34:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:41,737 INFO L225 Difference]: With dead ends: 2448 [2018-09-30 20:34:41,737 INFO L226 Difference]: Without dead ends: 2447 [2018-09-30 20:34:41,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s Time [2018-09-30 20:34:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2018-09-30 20:34:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 951. [2018-09-30 20:34:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-30 20:34:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-09-30 20:34:41,809 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-09-30 20:34:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:41,810 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-09-30 20:34:41,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-30 20:34:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-09-30 20:34:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 20:34:41,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:41,812 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-09-30 20:34:41,813 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:41,813 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-09-30 20:34:41,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:41,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 20:34:41,945 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:41,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:41,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:41,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:41,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:41,945 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-09-30 20:34:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:42,117 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-09-30 20:34:42,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:42,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-30 20:34:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:42,122 INFO L225 Difference]: With dead ends: 1902 [2018-09-30 20:34:42,123 INFO L226 Difference]: Without dead ends: 952 [2018-09-30 20:34:42,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-09-30 20:34:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-09-30 20:34:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 20:34:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-09-30 20:34:42,183 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-09-30 20:34:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:42,184 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-09-30 20:34:42,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-09-30 20:34:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 20:34:42,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:42,186 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-09-30 20:34:42,186 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:42,187 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-09-30 20:34:42,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:42,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-30 20:34:42,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:42,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:42,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:42,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:42,290 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-09-30 20:34:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:42,462 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-09-30 20:34:42,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:42,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 20:34:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:42,467 INFO L225 Difference]: With dead ends: 1560 [2018-09-30 20:34:42,467 INFO L226 Difference]: Without dead ends: 640 [2018-09-30 20:34:42,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-30 20:34:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-09-30 20:34:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-30 20:34:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-09-30 20:34:42,508 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-09-30 20:34:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:42,508 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-09-30 20:34:42,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-09-30 20:34:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 20:34:42,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:42,510 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-09-30 20:34:42,511 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:42,511 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-09-30 20:34:42,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-30 20:34:42,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:42,639 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-09-30 20:34:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-30 20:34:42,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:42,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-09-30 20:34:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:42,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:42,793 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-09-30 20:34:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:43,035 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-09-30 20:34:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:34:43,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-30 20:34:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:43,038 INFO L225 Difference]: With dead ends: 1394 [2018-09-30 20:34:43,038 INFO L226 Difference]: Without dead ends: 724 [2018-09-30 20:34:43,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-09-30 20:34:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-09-30 20:34:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-30 20:34:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-09-30 20:34:43,060 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-09-30 20:34:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:43,060 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-09-30 20:34:43,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-09-30 20:34:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 20:34:43,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:43,062 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-09-30 20:34:43,062 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:43,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-09-30 20:34:43,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:43,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-30 20:34:43,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:43,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:43,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:34:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:34:43,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:43,149 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-09-30 20:34:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:43,615 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-09-30 20:34:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:34:43,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-09-30 20:34:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:43,616 INFO L225 Difference]: With dead ends: 566 [2018-09-30 20:34:43,616 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:34:43,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:34:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:34:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:34:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:34:43,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-09-30 20:34:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:43,617 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:34:43,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:34:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:34:43,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:34:43,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:34:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:44,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:45,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:45,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:34:45,628 WARN L178 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 554 DAG size of output: 469 [2018-09-30 20:34:50,867 WARN L178 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 452 DAG size of output: 161 [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-09-30 20:34:50,872 INFO L426 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-09-30 20:34:50,873 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-09-30 20:34:50,874 INFO L426 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-09-30 20:34:50,874 INFO L422 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse29 (+ Elevator_min 2)) (.cse48 (+ |Elevator_current'| |Elevator_dir'|)) (.cse44 (+ |Elevator_goal'| 1))) (let ((.cse16 (<= |Elevator_current'| Elevator_max)) (.cse18 (<= Elevator_min |Elevator_current'|)) (.cse41 (<= |Elevator_current'| |Elevator_goal'|)) (.cse43 (<= |Elevator_goal'| |Elevator_current'|)) (.cse31 (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1))) (.cse45 (<= Elevator_min (+ |Elevator_goal'| |Elevator_dir'| 1))) (.cse9 (< |Elevator_current'| |Elevator_goal'|)) (.cse10 (<= .cse44 |Elevator_current'|)) (.cse28 (+ Elevator_dir Elevator_current)) (.cse46 (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (.cse33 (<= .cse29 .cse48)) (.cse1 (<= Elevator_c2 Elevator_c3))) (let ((.cse13 (or (<= Elevator_c2 2) .cse1)) (.cse17 (not (= Elevator_qCSP 3))) (.cse24 (or (and (<= Elevator_min .cse48) .cse46) (and (<= .cse48 Elevator_max) .cse33))) (.cse25 (or (and (<= .cse29 .cse28) (<= .cse28 Elevator_max)) (and (<= Elevator_min .cse28) (<= (+ Elevator_dir Elevator_current 2) Elevator_max)))) (.cse14 (or .cse9 .cse10)) (.cse15 (<= Elevator_qDC2 2)) (.cse19 (<= 2 Elevator_qDC2)) (.cse21 (let ((.cse47 (* 2 |Elevator_dir'|))) (or (and .cse31 (<= .cse29 (+ |Elevator_current'| .cse47)) (<= .cse48 |Elevator_goal'|)) (and (<= |Elevator_goal'| .cse48) .cse45 (<= (+ |Elevator_current'| .cse47 2) Elevator_max))))) (.cse37 (not Elevator_passed)) (.cse30 (and .cse45 .cse46 .cse43)) (.cse32 (< |Elevator_current'| .cse44)) (.cse22 (or (= (+ |Elevator_dir'| 1) 0) .cse41)) (.cse23 (or (= |Elevator_dir'| 1) .cse43)) (.cse7 (or (and .cse16 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse18))) (.cse34 (<= Elevator_qDC2 1)) (.cse36 (<= Elevator_qDC1 1)) (.cse20 (not Elevator_newgoal)) (.cse4 (<= Elevator_min Elevator_current)) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse2 (= Elevator_qDC2 3)) (.cse12 (<= Elevator_min Elevator_goal)) (.cse35 (= Elevator_qCSP 1)) (.cse0 (not Elevator_stop)) (.cse5 (<= Elevator_current Elevator_max)) (.cse3 (= Elevator_qDC1 2)) (.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 .cse0 .cse13 (and .cse3 (and .cse14 .cse15 (and .cse16 .cse4 .cse5 .cse17 .cse18 .cse8) .cse19 .cse11 .cse6 .cse12))) (and .cse20 (and .cse0 (let ((.cse26 (and .cse3 (and .cse14 .cse15 .cse4 .cse5 .cse19 .cse8 .cse11 .cse6 .cse12 .cse7)))) (or (and .cse3 .cse21 (and .cse16 .cse15 .cse4 .cse19 .cse18 .cse6 .cse12 .cse22 .cse14 .cse5 .cse23)) (and .cse24 .cse25 .cse26) (and (let ((.cse27 (* 2 Elevator_dir))) (or (and (<= (+ .cse27 Elevator_current 2) Elevator_max) (<= Elevator_goal .cse28)) (and (<= .cse28 Elevator_goal) (<= .cse29 (+ .cse27 Elevator_current))))) (or .cse30 (and .cse31 .cse32 .cse33)) .cse26))) .cse13)) (and .cse1 (and (and .cse16 .cse4 .cse5 .cse34 .cse18 .cse35) .cse3 .cse8 .cse11 .cse6 .cse12) .cse20) (and .cse0 (and .cse14 .cse15 .cse19 (and .cse16 .cse4 .cse5 .cse17 .cse18 .cse8 .cse6 .cse12 .cse36 .cse37) .cse11)) (and (and .cse0 (let ((.cse38 (and .cse16 .cse4 .cse5 .cse18 .cse8 .cse6 .cse12 .cse36 .cse37))) (or (and .cse24 .cse25 (and .cse14 .cse15 .cse19 .cse11 .cse38)) (and (and .cse22 .cse14 .cse15 .cse23 .cse19 .cse38) .cse21)))) .cse20) (and (let ((.cse39 (let ((.cse40 (let ((.cse42 (and .cse35 (and .cse16 .cse34 .cse18 .cse36)))) (or (and .cse41 .cse42 .cse43) (and .cse8 .cse11 .cse6 .cse12 .cse42))))) (or (and .cse22 .cse23 .cse7 .cse40) (and .cse4 .cse5 .cse6 .cse12 .cse40))))) (or (and .cse5 .cse39) (and .cse39 (or .cse30 (= |Elevator_goal'| |Elevator_current'|) (and .cse32 .cse33))))) .cse1) (and (and .cse16 .cse4 .cse18 .cse8 .cse2 .cse6 .cse12 .cse0 .cse1 .cse5 .cse3 .cse11) .cse20) (and .cse1 (and .cse16 .cse4 .cse18 .cse8 .cse6 .cse2 .cse12 .cse35 .cse0 .cse5 .cse3 .cse11)))))) [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-09-30 20:34:50,875 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-09-30 20:34:50,876 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-09-30 20:34:50,898 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:34:50 BoogieIcfgContainer [2018-09-30 20:34:50,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:34:50,899 INFO L168 Benchmark]: Toolchain (without parser) took 43077.36 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -373.4 MB). Peak memory consumption was 952.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:34:50,901 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-09-30 20:34:50,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.59 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-09-30 20:34:50,902 INFO L168 Benchmark]: Boogie Preprocessor took 31.97 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-09-30 20:34:50,903 INFO L168 Benchmark]: RCFGBuilder took 827.57 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-09-30 20:34:50,904 INFO L168 Benchmark]: TraceAbstraction took 42165.90 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -405.1 MB). Peak memory consumption was 920.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:34:50,910 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.26 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 45.59 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.97 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 827.57 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 42165.90 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -405.1 MB). Peak memory consumption was 920.3 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) || ((!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) && min <= goal') && goal <= max) && min <= goal)) || (!newgoal && (!stop && ((((qDC1 == 2 && (((goal' + dir' <= max + 1 && min + 2 <= current' + 2 * dir') && current' + dir' <= goal') || ((goal' <= current' + dir' && min <= goal' + dir' + 1) && current' + 2 * dir' + 2 <= max))) && (((((((((current' <= max && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal <= max) && min <= goal) && (dir' + 1 == 0 || current' <= goal')) && (current' < goal' || goal' + 1 <= current')) && current <= max) && (dir' == 1 || goal' <= current')) || ((((min <= current' + dir' && current' + dir' + 2 <= max) || (current' + dir' <= max && min + 2 <= current' + dir')) && ((min + 2 <= dir + current && dir + current <= max) || (min <= dir + current && dir + current + 2 <= max))) && qDC1 == 2 && (((((((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && min <= current) && current <= max) && 2 <= qDC2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current')))) || ((((2 * dir + current + 2 <= max && goal <= dir + current) || (dir + current <= goal && min + 2 <= 2 * dir + current)) && (((min <= goal' + dir' + 1 && current' + dir' + 2 <= max) && goal' <= current') || ((goal' + dir' <= max + 1 && current' < goal' + 1) && min + 2 <= current' + dir'))) && qDC1 == 2 && (((((((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && min <= current) && current <= max) && 2 <= qDC2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))))) && (c2 <= 2 || c2 <= c3))) || ((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')) || ((!stop && (((((min <= current' + dir' && current' + dir' + 2 <= max) || (current' + dir' <= max && min + 2 <= current' + dir')) && ((min + 2 <= dir + current && dir + current <= max) || (min <= dir + current && dir + current + 2 <= max))) && ((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && 2 <= qDC2) && min <= goal') && (((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) || (((((((dir' + 1 == 0 || current' <= goal') && (current' < goal' || goal' + 1 <= current')) && qDC2 <= 2) && (dir' == 1 || goal' <= current')) && 2 <= qDC2) && (((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && (((goal' + dir' <= max + 1 && min + 2 <= current' + 2 * dir') && current' + dir' <= goal') || ((goal' <= current' + dir' && min <= goal' + dir' + 1) && current' + 2 * dir' + 2 <= max))))) && !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)))) && ((((min <= goal' + dir' + 1 && current' + dir' + 2 <= max) && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir')))) && c2 <= c3)) || ((((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && !stop) && c2 <= c3) && current <= max) && qDC1 == 2) && min <= goal') && !newgoal)) || (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') - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 42.0s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 27.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1146 SDtfs, 2017 SDslu, 3648 SDs, 0 SdLazy, 2581 SolverSat, 257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 280 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.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, 3505 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 1212 HoareAnnotationTreeSize, 1 FomulaSimplifications, 719036 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 409845 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s 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-09-30_20-34-50-929.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-09-30_20-34-50-929.csv Received shutdown request...