java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:42:32,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:32,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:32,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:32,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:32,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:32,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:32,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:32,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:32,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:32,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:32,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:32,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:32,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:32,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:32,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:32,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:33,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:33,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:33,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:33,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:33,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:33,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:33,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:33,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:33,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:33,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:33,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:33,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:33,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:33,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:33,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:33,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:33,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:33,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:33,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:33,020 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 10:42:33,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:33,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:33,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:33,038 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:33,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:33,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:33,039 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:33,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:33,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:33,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:33,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:33,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:33,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:33,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:33,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:33,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:33,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:33,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:33,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:33,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:33,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:33,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:33,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:33,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:33,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:33,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:33,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:33,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:33,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:33,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:33,044 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:33,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:33,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:33,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:33,127 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:33,128 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:33,129 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-09-30 10:42:33,129 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-09-30 10:42:33,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:33,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:33,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:33,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:33,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:33,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,229 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:33,230 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:33,230 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:33,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:33,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:33,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:33,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:33,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/1) ... [2018-09-30 10:42:33,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:33,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:33,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:33,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:33,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (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 10:42:33,332 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-30 10:42:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-30 10:42:33,332 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-30 10:42:34,059 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:34,060 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:34 BoogieIcfgContainer [2018-09-30 10:42:34,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:34,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:34,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:34,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:34,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:33" (1/2) ... [2018-09-30 10:42:34,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d853c4c and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:34, skipping insertion in model container [2018-09-30 10:42:34,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:34" (2/2) ... [2018-09-30 10:42:34,072 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-09-30 10:42:34,082 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:34,091 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:42:34,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:34,144 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:34,145 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:34,145 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:34,145 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:34,145 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:34,145 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:34,145 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:34,146 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-30 10:42:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-30 10:42:34,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:34,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-30 10:42:34,170 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:34,177 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-09-30 10:42:34,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:34,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:34,328 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 10:42:34,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:34,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 10:42:34,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:34,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:34,351 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-30 10:42:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:34,878 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-09-30 10:42:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:34,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-30 10:42:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:34,895 INFO L225 Difference]: With dead ends: 84 [2018-09-30 10:42:34,896 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 10:42:34,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 10:42:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-30 10:42:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 10:42:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-09-30 10:42:34,947 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-09-30 10:42:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:34,948 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-09-30 10:42:34,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-09-30 10:42:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:42:34,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:34,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:34,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:34,950 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-09-30 10:42:34,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:34,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:34,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:34,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:34,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:42:34,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:34,984 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:34,984 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-09-30 10:42:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:35,236 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-09-30 10:42:35,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:35,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 10:42:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:35,241 INFO L225 Difference]: With dead ends: 157 [2018-09-30 10:42:35,242 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 10:42:35,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 10:42:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 10:42:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-30 10:42:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:42:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-09-30 10:42:35,275 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-09-30 10:42:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:35,276 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-09-30 10:42:35,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-09-30 10:42:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:42:35,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:35,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:35,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:35,281 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-09-30 10:42:35,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:35,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:35,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:35,363 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:35,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:35,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:35,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:35,365 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-09-30 10:42:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:35,912 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-09-30 10:42:35,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:35,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 10:42:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:35,916 INFO L225 Difference]: With dead ends: 205 [2018-09-30 10:42:35,916 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 10:42:35,917 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 10:42:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 10:42:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-09-30 10:42:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 10:42:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-09-30 10:42:35,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-09-30 10:42:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:35,930 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-09-30 10:42:35,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-09-30 10:42:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:42:35,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:35,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:35,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:35,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:35,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-09-30 10:42:35,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:35,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:35,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:35,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:36,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:36,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:36,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:36,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:36,088 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-09-30 10:42:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:36,636 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-09-30 10:42:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:42:36,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-09-30 10:42:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:36,640 INFO L225 Difference]: With dead ends: 321 [2018-09-30 10:42:36,640 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 10:42:36,641 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 10:42:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 10:42:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-09-30 10:42:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 10:42:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-09-30 10:42:36,660 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-09-30 10:42:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:36,661 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-09-30 10:42:36,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-09-30 10:42:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:42:36,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:36,663 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:36,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:36,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-09-30 10:42:36,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:36,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-30 10:42:36,714 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:36,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:36,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:36,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:36,715 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-09-30 10:42:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:36,924 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-09-30 10:42:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:36,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 10:42:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:36,931 INFO L225 Difference]: With dead ends: 522 [2018-09-30 10:42:36,931 INFO L226 Difference]: Without dead ends: 310 [2018-09-30 10:42:36,932 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 10:42:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-30 10:42:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-09-30 10:42:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 10:42:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-09-30 10:42:36,954 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-09-30 10:42:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:36,954 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-09-30 10:42:36,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-09-30 10:42:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:42:36,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:36,957 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:36,957 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:36,957 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-09-30 10:42:36,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:36,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 10:42:37,017 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:37,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:37,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:37,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:37,018 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-09-30 10:42:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:37,647 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-09-30 10:42:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:37,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 10:42:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:37,656 INFO L225 Difference]: With dead ends: 588 [2018-09-30 10:42:37,656 INFO L226 Difference]: Without dead ends: 367 [2018-09-30 10:42:37,657 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 10:42:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-30 10:42:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-09-30 10:42:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 10:42:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-09-30 10:42:37,678 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-09-30 10:42:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:37,679 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-09-30 10:42:37,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-09-30 10:42:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:42:37,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:37,681 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:37,681 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:37,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-09-30 10:42:37,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:42:37,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:37,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:37,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:37,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:37,720 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-09-30 10:42:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:37,897 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-09-30 10:42:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:37,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 10:42:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:37,901 INFO L225 Difference]: With dead ends: 880 [2018-09-30 10:42:37,902 INFO L226 Difference]: Without dead ends: 542 [2018-09-30 10:42:37,903 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 10:42:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-09-30 10:42:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-09-30 10:42:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-09-30 10:42:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-09-30 10:42:37,923 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-09-30 10:42:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:37,924 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-09-30 10:42:37,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-09-30 10:42:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:42:37,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:37,927 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:37,928 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:37,928 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-09-30 10:42:37,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:37,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:42:38,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:38,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:42:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:42:38,010 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:38,011 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-09-30 10:42:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:38,215 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-09-30 10:42:38,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:38,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-09-30 10:42:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:38,228 INFO L225 Difference]: With dead ends: 1096 [2018-09-30 10:42:38,228 INFO L226 Difference]: Without dead ends: 731 [2018-09-30 10:42:38,229 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 10:42:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-09-30 10:42:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-09-30 10:42:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-09-30 10:42:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-09-30 10:42:38,259 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-09-30 10:42:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:38,260 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-09-30 10:42:38,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:42:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-09-30 10:42:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 10:42:38,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:38,267 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:38,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:38,267 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-09-30 10:42:38,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:38,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:38,841 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 10:42:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:38,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:39,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:42:39,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 10:42:39,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:42:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:42:39,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:39,810 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-09-30 10:42:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:41,069 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-09-30 10:42:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:42:41,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-09-30 10:42:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:41,080 INFO L225 Difference]: With dead ends: 1293 [2018-09-30 10:42:41,081 INFO L226 Difference]: Without dead ends: 1292 [2018-09-30 10:42:41,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-09-30 10:42:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-09-30 10:42:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-09-30 10:42:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-09-30 10:42:41,130 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-09-30 10:42:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:41,131 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-09-30 10:42:41,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:42:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-09-30 10:42:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 10:42:41,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:41,135 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:41,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:41,136 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:41,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-09-30 10:42:41,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:41,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:41,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 10:42:41,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:41,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:41,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:42:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:42:41,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:41,342 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-09-30 10:42:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:41,880 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-09-30 10:42:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:42:41,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-30 10:42:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:41,891 INFO L225 Difference]: With dead ends: 2655 [2018-09-30 10:42:41,891 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 10:42:41,893 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 10:42:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 10:42:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-09-30 10:42:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-09-30 10:42:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-09-30 10:42:41,953 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-09-30 10:42:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-09-30 10:42:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:42:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-09-30 10:42:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:42:41,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:41,956 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:41,956 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:41,956 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-09-30 10:42:41,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-30 10:42:42,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:42,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:42,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:42:42,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:42:42,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:42,022 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-09-30 10:42:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:42,203 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-09-30 10:42:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:42,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-09-30 10:42:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:42,219 INFO L225 Difference]: With dead ends: 2726 [2018-09-30 10:42:42,219 INFO L226 Difference]: Without dead ends: 1469 [2018-09-30 10:42:42,221 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 10:42:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-09-30 10:42:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-09-30 10:42:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-09-30 10:42:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-09-30 10:42:42,270 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-09-30 10:42:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:42,270 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-09-30 10:42:42,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:42:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-09-30 10:42:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-30 10:42:42,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:42,273 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:42,273 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:42,273 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-09-30 10:42:42,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:42,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:42,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 10:42:42,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:42,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:42,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:42,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:42,320 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-09-30 10:42:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:42,775 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-09-30 10:42:42,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:42,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-09-30 10:42:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:42,783 INFO L225 Difference]: With dead ends: 2942 [2018-09-30 10:42:42,783 INFO L226 Difference]: Without dead ends: 1457 [2018-09-30 10:42:42,785 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 10:42:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-09-30 10:42:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-09-30 10:42:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-09-30 10:42:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-09-30 10:42:42,829 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-09-30 10:42:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:42,829 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-09-30 10:42:42,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-09-30 10:42:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 10:42:42,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:42,832 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:42,832 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:42,833 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-09-30 10:42:42,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:42:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-30 10:42:42,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:42,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:42,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:42,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:42,932 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-09-30 10:42:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:43,144 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-09-30 10:42:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:43,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-30 10:42:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:43,153 INFO L225 Difference]: With dead ends: 3297 [2018-09-30 10:42:43,153 INFO L226 Difference]: Without dead ends: 1830 [2018-09-30 10:42:43,155 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 10:42:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-09-30 10:42:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-09-30 10:42:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-09-30 10:42:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-09-30 10:42:43,204 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-09-30 10:42:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:43,204 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-09-30 10:42:43,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-09-30 10:42:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 10:42:43,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:43,207 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:43,207 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:43,208 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:43,208 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-09-30 10:42:43,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:43,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:43,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:42:44,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:44,043 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 10:42:44,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:44,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 10:42:46,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:42:46,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 10:42:46,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:42:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:42:46,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:46,597 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 14 states. [2018-09-30 10:42:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:50,163 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-09-30 10:42:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:42:50,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-09-30 10:42:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:50,178 INFO L225 Difference]: With dead ends: 3128 [2018-09-30 10:42:50,178 INFO L226 Difference]: Without dead ends: 3127 [2018-09-30 10:42:50,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-09-30 10:42:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-09-30 10:42:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-09-30 10:42:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-09-30 10:42:50,260 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-09-30 10:42:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-09-30 10:42:50,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:42:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-09-30 10:42:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:42:50,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:50,270 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:50,270 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:50,270 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-09-30 10:42:50,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:50,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-30 10:42:50,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:50,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:50,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:50,331 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:50,331 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-09-30 10:42:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:50,511 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-09-30 10:42:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:50,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 10:42:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:50,520 INFO L225 Difference]: With dead ends: 2399 [2018-09-30 10:42:50,520 INFO L226 Difference]: Without dead ends: 1130 [2018-09-30 10:42:50,522 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 10:42:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-09-30 10:42:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-09-30 10:42:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-09-30 10:42:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-09-30 10:42:50,564 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-09-30 10:42:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:50,564 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-09-30 10:42:50,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-09-30 10:42:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:42:50,567 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:50,568 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:50,568 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:50,568 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-09-30 10:42:50,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:50,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:50,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 10:42:50,648 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:50,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:50,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:50,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:50,649 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-09-30 10:42:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:51,116 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-09-30 10:42:51,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 10:42:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:51,120 INFO L225 Difference]: With dead ends: 2013 [2018-09-30 10:42:51,120 INFO L226 Difference]: Without dead ends: 850 [2018-09-30 10:42:51,122 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 10:42:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-09-30 10:42:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-09-30 10:42:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-09-30 10:42:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-09-30 10:42:51,149 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-09-30 10:42:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:51,150 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-09-30 10:42:51,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-09-30 10:42:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 10:42:51,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:51,152 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:51,152 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:51,152 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-09-30 10:42:51,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-30 10:42:51,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:51,813 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 10:42:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:51,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-30 10:42:52,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:42:52,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-09-30 10:42:52,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:42:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:42:52,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:52,041 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-09-30 10:42:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:53,773 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-09-30 10:42:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:42:53,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-09-30 10:42:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:53,777 INFO L225 Difference]: With dead ends: 1537 [2018-09-30 10:42:53,777 INFO L226 Difference]: Without dead ends: 1017 [2018-09-30 10:42:53,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-09-30 10:42:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-09-30 10:42:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-09-30 10:42:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-09-30 10:42:53,809 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-09-30 10:42:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:53,809 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-09-30 10:42:53,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:42:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-09-30 10:42:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 10:42:53,811 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:53,811 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:53,812 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:53,812 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-09-30 10:42:53,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:53,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:53,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 10:42:53,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:53,977 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 10:42:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-09-30 10:42:54,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:42:54,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 10:42:54,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:54,279 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:54,279 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-09-30 10:42:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:54,489 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-09-30 10:42:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:42:54,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-09-30 10:42:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:54,492 INFO L225 Difference]: With dead ends: 1396 [2018-09-30 10:42:54,492 INFO L226 Difference]: Without dead ends: 661 [2018-09-30 10:42:54,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-30 10:42:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-09-30 10:42:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-09-30 10:42:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-09-30 10:42:54,516 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-09-30 10:42:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:54,516 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-09-30 10:42:54,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-09-30 10:42:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-30 10:42:54,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:54,519 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:54,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:54,519 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-09-30 10:42:54,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:54,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-30 10:42:54,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:54,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:54,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:54,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:54,595 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-09-30 10:42:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:54,688 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-09-30 10:42:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-09-30 10:42:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:54,691 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 10:42:54,691 INFO L226 Difference]: Without dead ends: 667 [2018-09-30 10:42:54,692 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 10:42:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-09-30 10:42:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-09-30 10:42:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-09-30 10:42:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-09-30 10:42:54,715 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-09-30 10:42:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:54,716 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-09-30 10:42:54,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-09-30 10:42:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 10:42:54,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:54,718 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:54,718 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:54,718 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-09-30 10:42:54,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-30 10:42:54,788 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:54,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:54,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:54,789 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-09-30 10:42:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:54,906 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-09-30 10:42:54,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:42:54,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-09-30 10:42:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:54,907 INFO L225 Difference]: With dead ends: 930 [2018-09-30 10:42:54,907 INFO L226 Difference]: Without dead ends: 336 [2018-09-30 10:42:54,908 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 10:42:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-09-30 10:42:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-09-30 10:42:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-30 10:42:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-09-30 10:42:54,920 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-09-30 10:42:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:54,920 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-09-30 10:42:54,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-09-30 10:42:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 10:42:54,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:54,922 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:54,922 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:54,922 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-09-30 10:42:54,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:54,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-30 10:42:55,002 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:55,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:55,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:42:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:42:55,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:55,003 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-09-30 10:42:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:55,125 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-09-30 10:42:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:42:55,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-09-30 10:42:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:55,127 INFO L225 Difference]: With dead ends: 663 [2018-09-30 10:42:55,127 INFO L226 Difference]: Without dead ends: 335 [2018-09-30 10:42:55,127 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 10:42:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-30 10:42:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-09-30 10:42:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-30 10:42:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-09-30 10:42:55,140 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-09-30 10:42:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:55,141 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-09-30 10:42:55,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:42:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-09-30 10:42:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-30 10:42:55,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:55,142 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:55,143 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:42:55,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-09-30 10:42:55,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 10:42:55,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:55,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:42:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:42:55,789 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:42:55,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:42:55,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-30 10:42:56,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:42:56,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 10:42:56,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:42:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:42:56,538 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:56,538 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 18 states. [2018-09-30 10:43:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:00,756 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-09-30 10:43:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:43:00,759 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-30 10:43:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:00,764 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 10:43:00,764 INFO L226 Difference]: Without dead ends: 1063 [2018-09-30 10:43:00,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-30 10:43:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-09-30 10:43:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-30 10:43:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-09-30 10:43:00,783 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-09-30 10:43:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:00,783 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-09-30 10:43:00,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:43:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-09-30 10:43:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-30 10:43:00,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:00,784 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:00,785 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:43:00,785 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-09-30 10:43:00,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:00,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:00,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:00,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:43:00,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-30 10:43:00,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:00,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:43:00,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:43:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:43:00,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:00,948 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-09-30 10:43:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:01,073 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-09-30 10:43:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:43:01,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-09-30 10:43:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:01,075 INFO L225 Difference]: With dead ends: 673 [2018-09-30 10:43:01,075 INFO L226 Difference]: Without dead ends: 468 [2018-09-30 10:43:01,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-09-30 10:43:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-09-30 10:43:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-09-30 10:43:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-09-30 10:43:01,092 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-09-30 10:43:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:01,093 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-09-30 10:43:01,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:43:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-09-30 10:43:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-30 10:43:01,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:01,094 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:01,095 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:43:01,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-09-30 10:43:01,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:01,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-30 10:43:01,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:01,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:01,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:01,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 10:43:02,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:02,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-30 10:43:02,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:02,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:02,041 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 9 states. [2018-09-30 10:43:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:02,847 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-09-30 10:43:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:43:02,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-09-30 10:43:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:02,851 INFO L225 Difference]: With dead ends: 845 [2018-09-30 10:43:02,851 INFO L226 Difference]: Without dead ends: 844 [2018-09-30 10:43:02,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-09-30 10:43:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-09-30 10:43:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 10:43:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-09-30 10:43:02,878 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-09-30 10:43:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:02,878 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-09-30 10:43:02,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-09-30 10:43:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-30 10:43:02,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:02,880 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:02,881 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:43:02,881 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:02,881 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-09-30 10:43:02,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:02,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:02,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-30 10:43:02,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:02,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:43:02,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:43:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:43:02,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:02,992 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-09-30 10:43:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:03,140 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-09-30 10:43:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:43:03,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-09-30 10:43:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:03,142 INFO L225 Difference]: With dead ends: 1086 [2018-09-30 10:43:03,142 INFO L226 Difference]: Without dead ends: 479 [2018-09-30 10:43:03,143 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 10:43:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-30 10:43:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-09-30 10:43:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-30 10:43:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-09-30 10:43:03,164 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-09-30 10:43:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:03,164 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-09-30 10:43:03,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:43:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-09-30 10:43:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-30 10:43:03,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:03,165 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:03,165 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 10:43:03,166 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-09-30 10:43:03,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:03,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:03,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:43:03,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 10:43:03,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:03,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:03,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-30 10:43:04,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:04,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-09-30 10:43:04,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:43:04,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:43:04,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:04,697 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-09-30 10:43:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:09,440 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-09-30 10:43:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:43:09,440 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-09-30 10:43:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:09,441 INFO L225 Difference]: With dead ends: 970 [2018-09-30 10:43:09,441 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:43:09,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:43:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:43:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:43:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:43:09,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-09-30 10:43:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:09,443 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:43:09,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:43:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:43:09,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:43:09,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:43:09,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:10,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:11,899 WARN L178 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 666 DAG size of output: 595 [2018-09-30 10:43:19,677 WARN L178 SmtUtils]: Spent 7.77 s on a formula simplification. DAG size of input: 573 DAG size of output: 165 [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-09-30 10:43:19,682 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-09-30 10:43:19,683 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-09-30 10:43:19,683 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-09-30 10:43:19,683 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-09-30 10:43:19,683 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-09-30 10:43:19,683 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L422 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse46 (+ Elevator_dir Elevator_goal))) (let ((.cse16 (<= Elevator_min Elevator_current)) (.cse17 (<= Elevator_current Elevator_max)) (.cse50 (= Elevator_current Elevator_goal)) (.cse30 (<= .cse46 (+ Elevator_max 1))) (.cse49 (+ Elevator_dir 1)) (.cse36 (+ Elevator_dir Elevator_current))) (let ((.cse42 (<= (+ Elevator_min 2) .cse36)) (.cse44 (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2))) (.cse25 (not (= Elevator_goal Elevator_current))) (.cse45 (<= Elevator_current (+ Elevator_dir Elevator_min))) (.cse47 (= Elevator_dir 1)) (.cse48 (= .cse49 0)) (.cse37 (and (<= .cse36 Elevator_goal) .cse30)) (.cse43 (<= Elevator_goal Elevator_current)) (.cse3 (not Elevator_stop)) (.cse12 (not .cse50)) (.cse6 (= Elevator_qDC2 2)) (.cse2 (<= Elevator_qDC1 1)) (.cse24 (not Elevator_passed)) (.cse13 (= Elevator_qDC1 2)) (.cse23 (and .cse16 .cse17)) (.cse32 (= Elevator_qCSP 1)) (.cse7 (= Elevator_qCSP 3))) (let ((.cse14 (not .cse7)) (.cse15 (not .cse32)) (.cse5 (= Elevator_current Elevator_min)) (.cse33 (= Elevator_qDC2 1)) (.cse38 (and .cse13 .cse23 .cse32)) (.cse39 (and .cse3 (and .cse12 .cse6 .cse23 .cse2 .cse24))) (.cse35 (= Elevator_min Elevator_current)) (.cse0 (not (= Elevator_min Elevator_goal))) (.cse34 (or .cse43 (<= Elevator_dir 1))) (.cse9 (or (<= .cse49 0) .cse50 .cse37)) (.cse21 (or (<= Elevator_current Elevator_goal) .cse48)) (.cse22 (and .cse3 (and .cse12 .cse13 .cse6 .cse23))) (.cse8 (or .cse43 .cse47)) (.cse10 (or .cse42 (and .cse43 (and .cse44 .cse25)) .cse45)) (.cse26 (or (<= Elevator_current .cse46) .cse48)) (.cse27 (or (and (<= (+ Elevator_current 1) Elevator_max) .cse16) (and .cse17 (<= (+ Elevator_min 1) Elevator_current)))) (.cse28 (not (= .cse46 Elevator_current))) (.cse29 (or (<= .cse46 Elevator_current) .cse47)) (.cse11 (<= Elevator_c2 2)) (.cse1 (not Elevator_newgoal)) (.cse4 (<= Elevator_c2 Elevator_c3)) (.cse40 (= Elevator_qDC2 3)) (.cse18 (<= Elevator_goal Elevator_max)) (.cse19 (<= Elevator_min Elevator_goal)) (.cse31 (or .cse42 (and .cse43 (or .cse44 (< Elevator_current (+ Elevator_goal 1)))) .cse45)) (.cse20 (not Elevator_start))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (and (and .cse11 .cse12 (and .cse3 .cse13 .cse14 .cse6 .cse15) .cse16 .cse17 .cse4 .cse18 .cse19) .cse20) (and .cse21 (and (and .cse11 (and .cse22 .cse1 .cse7)) .cse18 .cse19) .cse8) (and (and .cse4 (and (and .cse3 (and .cse14 .cse6 .cse23 .cse2 .cse24)) .cse15) .cse18 .cse19) .cse25 .cse20) (and .cse26 .cse27 .cse28 .cse19 .cse29 .cse30 .cse31 (and .cse4 (and (and .cse32 .cse2 .cse24) .cse33 .cse1)) .cse20) (and .cse34 (and .cse4 (and .cse35 (and .cse3 (and (and .cse0 (and .cse14 .cse2)) .cse6) .cse15)) .cse18 .cse19) .cse10 .cse20) (and .cse34 (and (and .cse33 (and .cse4 (and (and .cse2 .cse32) .cse5))) .cse18) (<= Elevator_min .cse36) (or .cse25 (<= (+ Elevator_dir Elevator_current 1) Elevator_max)) .cse37) (and .cse26 .cse27 .cse28 .cse29 (and .cse11 .cse4 .cse18 .cse19 (and .cse38 .cse33 .cse1)) .cse31 .cse20) (and .cse21 (and .cse18 .cse19 (and .cse39 .cse1 .cse7)) .cse8) (and .cse4 (and .cse3 .cse38 .cse40) .cse24) (and .cse3 .cse4 .cse13 (and .cse12 .cse23) .cse40 .cse24) (and .cse21 .cse8 .cse10 .cse20 (and .cse4 (and .cse39 .cse1) .cse18 .cse19)) (and (and (and .cse3 .cse4 .cse35 (and (and .cse0 .cse2 .cse32) .cse6) .cse1) .cse18) .cse34 .cse9 .cse10 .cse20) (and .cse21 (and .cse11 .cse4 (and .cse22 .cse1)) .cse18 .cse19 .cse8 .cse10 .cse20) (and .cse26 .cse27 .cse28 .cse29 (and (and .cse11 (and .cse1 (let ((.cse41 (and .cse3 (and .cse13 .cse23) .cse40))) (or (and (<= 0 Elevator_c3) .cse41 (<= Elevator_c2 0)) (and .cse4 .cse41 .cse24))) .cse7)) .cse18 .cse19) .cse31 .cse20)))))) [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-09-30 10:43:19,684 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-09-30 10:43:19,685 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-09-30 10:43:19,717 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:43:19 BoogieIcfgContainer [2018-09-30 10:43:19,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:43:19,718 INFO L168 Benchmark]: Toolchain (without parser) took 46532.04 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 545.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.0 MB). Peak memory consumption was 987.9 MB. Max. memory is 7.1 GB. [2018-09-30 10:43:19,723 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:43:19,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:43:19,724 INFO L168 Benchmark]: Boogie Preprocessor took 30.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:43:19,727 INFO L168 Benchmark]: RCFGBuilder took 796.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:43:19,728 INFO L168 Benchmark]: TraceAbstraction took 45652.22 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 545.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -485.8 MB). Peak memory consumption was 956.2 MB. Max. memory is 7.1 GB. [2018-09-30 10:43:19,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 796.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45652.22 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 545.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -485.8 MB). Peak memory consumption was 956.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(min == goal) && !newgoal) && qDC1 <= 1) && !stop) && c2 <= c3) && current == min) && qDC2 == 2) && qCSP == 3) && (goal <= current || dir == 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) || ((((((((c2 <= 2 && !(current == goal)) && (((!stop && qDC1 == 2) && !(qCSP == 3)) && qDC2 == 2) && !(qCSP == 1)) && min <= current) && current <= max) && c2 <= c3) && goal <= max) && min <= goal) && !start)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || (((((c2 <= c3 && (!stop && (((!(qCSP == 3) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !(goal == current)) && !start)) || (((((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && min <= goal) && (dir + goal <= current || dir == 1)) && dir + goal <= max + 1) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && c2 <= c3 && (((qCSP == 1 && qDC1 <= 1) && !passed) && qDC2 == 1) && !newgoal) && !start)) || ((((goal <= current || dir <= 1) && ((c2 <= c3 && min == current && (!stop && (!(min == goal) && !(qCSP == 3) && qDC1 <= 1) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((goal <= current || dir <= 1) && (qDC2 == 1 && c2 <= c3 && (qDC1 <= 1 && qCSP == 1) && current == min) && goal <= max) && min <= dir + current) && (!(goal == current) || dir + current + 1 <= max)) && dir + current <= goal && dir + goal <= max + 1)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && (((c2 <= 2 && c2 <= c3) && goal <= max) && min <= goal) && (((qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 1) && !newgoal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start)) || (((current <= goal || dir + 1 == 0) && (goal <= max && min <= goal) && ((!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && (goal <= current || dir == 1))) || ((c2 <= c3 && (!stop && (qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 3) && !passed)) || (((((!stop && c2 <= c3) && qDC1 == 2) && !(current == goal) && min <= current && current <= max) && qDC2 == 3) && !passed)) || (((((current <= goal || dir + 1 == 0) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start) && ((c2 <= c3 && (!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && goal <= max) && min <= goal)) || (((((((((!stop && c2 <= c3) && min == current) && ((!(min == goal) && qDC1 <= 1) && qCSP == 1) && qDC2 == 2) && !newgoal) && goal <= max) && (goal <= current || dir <= 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((((current <= goal || dir + 1 == 0) && (c2 <= 2 && c2 <= c3) && (!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !newgoal) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && ((c2 <= 2 && (!newgoal && (((0 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && c2 <= 0) || ((c2 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && !passed))) && qCSP == 3) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 45.5s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4341 SDslu, 4562 SDs, 0 SdLazy, 2455 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 745 SyntacticMatches, 15 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 1114 HoareAnnotationTreeSize, 1 FomulaSimplifications, 368978 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 337510 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 4736705 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 4169/5710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-43-19-758.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-43-19-758.csv Received shutdown request...