java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:28:19,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:28:19,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:28:19,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:28:19,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:28:19,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:28:19,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:28:19,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:28:19,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:28:19,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:28:19,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:28:19,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:28:19,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:28:19,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:28:19,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:28:19,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:28:19,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:28:19,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:28:19,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:28:19,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:28:19,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:28:19,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:28:19,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:28:19,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:28:19,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:28:19,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:28:19,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:28:19,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:28:19,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:28:19,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:28:19,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:28:19,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:28:19,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:28:19,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:28:19,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:28:19,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:28:19,290 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:28:19,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:28:19,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:28:19,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:28:19,318 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:28:19,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:28:19,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:28:19,319 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:28:19,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:28:19,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:28:19,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:28:19,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:28:19,406 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:28:19,407 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:28:19,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-07-23 15:28:19,408 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-07-23 15:28:19,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:28:19,503 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:28:19,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:28:19,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:28:19,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:28:19,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:28:19,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:28:19,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:28:19,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:28:19,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/1) ... [2018-07-23 15:28:19,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:28:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:28:20,103 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:28:20,104 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:28:20 BoogieIcfgContainer [2018-07-23 15:28:20,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:28:20,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:28:20,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:28:20,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:28:20,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:19" (1/2) ... [2018-07-23 15:28:20,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3356dac2 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:28:20, skipping insertion in model container [2018-07-23 15:28:20,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:28:20" (2/2) ... [2018-07-23 15:28:20,115 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-07-23 15:28:20,125 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:28:20,134 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:28:20,184 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:28:20,185 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:28:20,186 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:28:20,186 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:28:20,186 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:28:20,186 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:28:20,186 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:28:20,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:28:20,187 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:28:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-07-23 15:28:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:28:20,214 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:20,215 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:20,216 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-07-23 15:28:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:28:20,349 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:20,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:20,355 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:20,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:20,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,374 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-07-23 15:28:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:20,577 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2018-07-23 15:28:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:20,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-07-23 15:28:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:20,601 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:28:20,601 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 15:28:20,605 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 15:28:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 15:28:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 15:28:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-07-23 15:28:20,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 16 [2018-07-23 15:28:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 54 transitions. [2018-07-23 15:28:20,654 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 54 transitions. [2018-07-23 15:28:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:28:20,655 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:20,656 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:20,656 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-07-23 15:28:20,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:28:20,723 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:20,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:20,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:20,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:20,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,727 INFO L87 Difference]: Start difference. First operand 32 states and 54 transitions. Second operand 3 states. [2018-07-23 15:28:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:20,802 INFO L93 Difference]: Finished difference Result 79 states and 135 transitions. [2018-07-23 15:28:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:20,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-07-23 15:28:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:20,806 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:28:20,806 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 15:28:20,810 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 15:28:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 15:28:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 15:28:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 80 transitions. [2018-07-23 15:28:20,825 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 80 transitions. Word has length 24 [2018-07-23 15:28:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:20,825 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 80 transitions. [2018-07-23 15:28:20,826 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-07-23 15:28:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 15:28:20,827 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:20,827 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:20,828 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1986992726, now seen corresponding path program 1 times [2018-07-23 15:28:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:28:20,873 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:20,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:20,874 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:20,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,875 INFO L87 Difference]: Start difference. First operand 48 states and 80 transitions. Second operand 3 states. [2018-07-23 15:28:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:20,994 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2018-07-23 15:28:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:20,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-07-23 15:28:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:20,997 INFO L225 Difference]: With dead ends: 113 [2018-07-23 15:28:20,997 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:28:20,998 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:28:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:28:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:28:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2018-07-23 15:28:21,015 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 29 [2018-07-23 15:28:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,016 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2018-07-23 15:28:21,016 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2018-07-23 15:28:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 15:28:21,017 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,018 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,018 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-07-23 15:28:21,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 15:28:21,052 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:21,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:21,053 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:21,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:21,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,054 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand 3 states. [2018-07-23 15:28:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,108 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-23 15:28:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:21,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-07-23 15:28:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,110 INFO L225 Difference]: With dead ends: 136 [2018-07-23 15:28:21,110 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 15:28:21,112 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 15:28:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 15:28:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 15:28:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-07-23 15:28:21,131 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 31 [2018-07-23 15:28:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,132 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2018-07-23 15:28:21,132 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2018-07-23 15:28:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 15:28:21,134 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,134 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,136 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-07-23 15:28:21,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-23 15:28:21,189 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:21,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:21,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:21,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:21,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,192 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand 3 states. [2018-07-23 15:28:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,290 INFO L93 Difference]: Finished difference Result 149 states and 243 transitions. [2018-07-23 15:28:21,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:21,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-07-23 15:28:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,294 INFO L225 Difference]: With dead ends: 149 [2018-07-23 15:28:21,294 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 15:28:21,295 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 15:28:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 15:28:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 15:28:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2018-07-23 15:28:21,328 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 37 [2018-07-23 15:28:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,328 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2018-07-23 15:28:21,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2018-07-23 15:28:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 15:28:21,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,331 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,332 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 250671570, now seen corresponding path program 1 times [2018-07-23 15:28:21,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-23 15:28:21,378 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:21,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:21,379 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:21,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:21,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,382 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand 3 states. [2018-07-23 15:28:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,483 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2018-07-23 15:28:21,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:21,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-23 15:28:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,485 INFO L225 Difference]: With dead ends: 167 [2018-07-23 15:28:21,485 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 15:28:21,486 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 15:28:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 15:28:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:28:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2018-07-23 15:28:21,519 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 41 [2018-07-23 15:28:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,519 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2018-07-23 15:28:21,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2018-07-23 15:28:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 15:28:21,527 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,527 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,527 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-07-23 15:28:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 15:28:21,564 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:21,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:21,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:21,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:21,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,566 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand 3 states. [2018-07-23 15:28:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,647 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2018-07-23 15:28:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:21,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-07-23 15:28:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,649 INFO L225 Difference]: With dead ends: 182 [2018-07-23 15:28:21,649 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 15:28:21,650 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 15:28:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 15:28:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 15:28:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2018-07-23 15:28:21,672 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 42 [2018-07-23 15:28:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,675 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2018-07-23 15:28:21,676 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2018-07-23 15:28:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:28:21,684 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,684 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,684 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-07-23 15:28:21,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-23 15:28:21,726 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:21,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:21,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:21,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:21,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,728 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 3 states. [2018-07-23 15:28:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,770 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2018-07-23 15:28:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:21,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-07-23 15:28:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,773 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:28:21,773 INFO L226 Difference]: Without dead ends: 180 [2018-07-23 15:28:21,774 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-23 15:28:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-23 15:28:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 15:28:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2018-07-23 15:28:21,803 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 46 [2018-07-23 15:28:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2018-07-23 15:28:21,804 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2018-07-23 15:28:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 15:28:21,806 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:21,806 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:21,806 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-07-23 15:28:21,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 15:28:21,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:21,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:21,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:21,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:21,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:21,852 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 4 states. [2018-07-23 15:28:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:21,983 INFO L93 Difference]: Finished difference Result 520 states and 725 transitions. [2018-07-23 15:28:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:28:21,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-07-23 15:28:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:21,987 INFO L225 Difference]: With dead ends: 520 [2018-07-23 15:28:21,987 INFO L226 Difference]: Without dead ends: 325 [2018-07-23 15:28:21,988 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-23 15:28:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 185. [2018-07-23 15:28:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:28:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2018-07-23 15:28:22,041 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 49 [2018-07-23 15:28:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2018-07-23 15:28:22,041 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2018-07-23 15:28:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:28:22,044 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,045 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,045 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1163715148, now seen corresponding path program 1 times [2018-07-23 15:28:22,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-23 15:28:22,098 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,104 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand 3 states. [2018-07-23 15:28:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,166 INFO L93 Difference]: Finished difference Result 280 states and 384 transitions. [2018-07-23 15:28:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-07-23 15:28:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,168 INFO L225 Difference]: With dead ends: 280 [2018-07-23 15:28:22,169 INFO L226 Difference]: Without dead ends: 184 [2018-07-23 15:28:22,171 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-23 15:28:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-23 15:28:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 15:28:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2018-07-23 15:28:22,209 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 64 [2018-07-23 15:28:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,210 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2018-07-23 15:28:22,210 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2018-07-23 15:28:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:28:22,211 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,211 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,211 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -261968970, now seen corresponding path program 1 times [2018-07-23 15:28:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-07-23 15:28:22,262 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,263 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,264 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand 3 states. [2018-07-23 15:28:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,325 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2018-07-23 15:28:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-07-23 15:28:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,327 INFO L225 Difference]: With dead ends: 278 [2018-07-23 15:28:22,327 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 15:28:22,327 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 15:28:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 15:28:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 15:28:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 243 transitions. [2018-07-23 15:28:22,362 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 243 transitions. Word has length 68 [2018-07-23 15:28:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,363 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 243 transitions. [2018-07-23 15:28:22,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-07-23 15:28:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 15:28:22,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,364 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,365 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash 67206980, now seen corresponding path program 1 times [2018-07-23 15:28:22,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-23 15:28:22,407 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,407 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,409 INFO L87 Difference]: Start difference. First operand 183 states and 243 transitions. Second operand 3 states. [2018-07-23 15:28:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,478 INFO L93 Difference]: Finished difference Result 359 states and 478 transitions. [2018-07-23 15:28:22,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-07-23 15:28:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,480 INFO L225 Difference]: With dead ends: 359 [2018-07-23 15:28:22,480 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 15:28:22,481 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 15:28:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-23 15:28:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-23 15:28:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2018-07-23 15:28:22,513 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 73 [2018-07-23 15:28:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,514 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2018-07-23 15:28:22,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2018-07-23 15:28:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 15:28:22,515 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,516 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,516 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2144712448, now seen corresponding path program 1 times [2018-07-23 15:28:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-23 15:28:22,560 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,561 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,562 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand 3 states. [2018-07-23 15:28:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,619 INFO L93 Difference]: Finished difference Result 356 states and 465 transitions. [2018-07-23 15:28:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-07-23 15:28:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,621 INFO L225 Difference]: With dead ends: 356 [2018-07-23 15:28:22,621 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 15:28:22,622 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 15:28:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 15:28:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:28:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2018-07-23 15:28:22,654 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 79 [2018-07-23 15:28:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2018-07-23 15:28:22,655 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2018-07-23 15:28:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:28:22,656 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,656 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,656 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1621627340, now seen corresponding path program 1 times [2018-07-23 15:28:22,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 15:28:22,721 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,722 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,723 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand 3 states. [2018-07-23 15:28:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,780 INFO L93 Difference]: Finished difference Result 356 states and 457 transitions. [2018-07-23 15:28:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-07-23 15:28:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,782 INFO L225 Difference]: With dead ends: 356 [2018-07-23 15:28:22,782 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 15:28:22,783 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 15:28:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 15:28:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 15:28:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2018-07-23 15:28:22,815 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 86 [2018-07-23 15:28:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2018-07-23 15:28:22,816 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2018-07-23 15:28:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:28:22,817 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,817 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,818 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1635470422, now seen corresponding path program 1 times [2018-07-23 15:28:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-23 15:28:22,881 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:22,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:22,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:22,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:22,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,883 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 3 states. [2018-07-23 15:28:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:22,947 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2018-07-23 15:28:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:22,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-07-23 15:28:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:22,950 INFO L225 Difference]: With dead ends: 378 [2018-07-23 15:28:22,950 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 15:28:22,951 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 15:28:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 15:28:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:28:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2018-07-23 15:28:22,984 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 94 [2018-07-23 15:28:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:22,985 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2018-07-23 15:28:22,985 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2018-07-23 15:28:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:28:22,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:22,986 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:22,987 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 386823290, now seen corresponding path program 1 times [2018-07-23 15:28:22,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-23 15:28:23,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:23,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:23,096 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:23,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:23,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:23,096 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand 4 states. [2018-07-23 15:28:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:23,197 INFO L93 Difference]: Finished difference Result 587 states and 729 transitions. [2018-07-23 15:28:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:28:23,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-07-23 15:28:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:23,201 INFO L225 Difference]: With dead ends: 587 [2018-07-23 15:28:23,201 INFO L226 Difference]: Without dead ends: 484 [2018-07-23 15:28:23,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-07-23 15:28:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 294. [2018-07-23 15:28:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-23 15:28:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2018-07-23 15:28:23,327 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 104 [2018-07-23 15:28:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:23,327 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2018-07-23 15:28:23,327 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2018-07-23 15:28:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:28:23,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:23,329 INFO L353 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:23,329 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1126094439, now seen corresponding path program 2 times [2018-07-23 15:28:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-23 15:28:23,423 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:23,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:23,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:23,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:23,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:23,425 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand 3 states. [2018-07-23 15:28:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:23,510 INFO L93 Difference]: Finished difference Result 580 states and 723 transitions. [2018-07-23 15:28:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:23,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-07-23 15:28:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:23,513 INFO L225 Difference]: With dead ends: 580 [2018-07-23 15:28:23,513 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 15:28:23,514 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 15:28:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-07-23 15:28:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-23 15:28:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 352 transitions. [2018-07-23 15:28:23,574 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 352 transitions. Word has length 140 [2018-07-23 15:28:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:23,574 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 352 transitions. [2018-07-23 15:28:23,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 352 transitions. [2018-07-23 15:28:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-23 15:28:23,577 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:23,577 INFO L353 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:23,578 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 323678285, now seen corresponding path program 1 times [2018-07-23 15:28:23,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 737 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-23 15:28:23,677 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:23,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:23,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:23,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:23,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:23,679 INFO L87 Difference]: Start difference. First operand 294 states and 352 transitions. Second operand 4 states. [2018-07-23 15:28:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:23,758 INFO L93 Difference]: Finished difference Result 492 states and 592 transitions. [2018-07-23 15:28:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:28:23,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-07-23 15:28:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:23,759 INFO L225 Difference]: With dead ends: 492 [2018-07-23 15:28:23,759 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:28:23,760 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:28:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:28:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:28:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:28:23,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-07-23 15:28:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:23,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:28:23,762 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:28:23,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:28:23,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:28:23,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:23,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:24,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:28:25,010 INFO L417 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,010 INFO L417 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-23 15:28:25,011 INFO L417 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,012 INFO L417 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-23 15:28:25,013 INFO L417 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,013 INFO L417 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) [2018-07-23 15:28:25,014 INFO L417 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2) (and .cse3 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,014 INFO L421 ceAbstractionStarter]: For program point L457(lines 457 478) no Hoare annotation was computed. [2018-07-23 15:28:25,014 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-07-23 15:28:25,015 INFO L417 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,019 INFO L417 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3 .cse4) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3 .cse4))) [2018-07-23 15:28:25,020 INFO L421 ceAbstractionStarter]: For program point L480(lines 477 490) no Hoare annotation was computed. [2018-07-23 15:28:25,020 INFO L417 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-23 15:28:25,020 INFO L421 ceAbstractionStarter]: For program point L444(lines 441 466) no Hoare annotation was computed. [2018-07-23 15:28:25,021 INFO L417 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-23 15:28:25,021 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 517) the Hoare annotation is: true [2018-07-23 15:28:25,021 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 517) the Hoare annotation is: false [2018-07-23 15:28:25,021 INFO L417 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-23 15:28:25,022 INFO L421 ceAbstractionStarter]: For program point L431(lines 431 442) no Hoare annotation was computed. [2018-07-23 15:28:25,022 INFO L417 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-23 15:28:25,022 INFO L417 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-07-23 15:28:25,025 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 516) the Hoare annotation is: false [2018-07-23 15:28:25,026 INFO L417 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,026 INFO L417 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) [2018-07-23 15:28:25,027 INFO L417 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-23 15:28:25,053 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:28:25 BoogieIcfgContainer [2018-07-23 15:28:25,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:28:25,057 INFO L168 Benchmark]: Toolchain (without parser) took 5552.75 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 65.0 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 324.3 MB). Peak memory consumption was 389.3 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:25,059 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-07-23 15:28:25,060 INFO L168 Benchmark]: Boogie Preprocessor took 86.76 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-07-23 15:28:25,062 INFO L168 Benchmark]: RCFGBuilder took 514.04 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:25,064 INFO L168 Benchmark]: TraceAbstraction took 4947.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 65.0 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 303.1 MB). Peak memory consumption was 368.1 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:25,070 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.20 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 86.76 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 514.04 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4947.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 65.0 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 303.1 MB). Peak memory consumption was 368.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6))) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((!(8448 == ssl3_accept_~s__state~6) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 139 SDslu, 168 SDs, 0 SdLazy, 587 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 243 NumberOfFragments, 574 HoareAnnotationTreeSize, 20 FomulaSimplifications, 13235 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5432 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1188 ConstructedInterpolants, 0 QuantifiedInterpolants, 152579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 3861/3958 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/s3_srvr_1.cil.c_23.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-28-25-093.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-28-25-093.csv Received shutdown request...