java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:46,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:46,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:46,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:46,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:46,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:46,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:46,255 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:46,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:46,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:46,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:46,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:46,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:46,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:46,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:46,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:46,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:46,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:46,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:46,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:46,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:46,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:46,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:46,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:46,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:46,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:46,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:46,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:46,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:46,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:46,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:46,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:46,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:46,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:46,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:46,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:46,287 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:19:46,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:46,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:46,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:46,304 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:46,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:46,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:46,307 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:46,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:46,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:46,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:46,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:46,394 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:46,394 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:46,395 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-09-26 08:19:46,395 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-09-26 08:19:46,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:46,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:46,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:46,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:46,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:46,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:46,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:46,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:46,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:46,527 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,527 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,531 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,531 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,541 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,544 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,547 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:46,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:46,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:46,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:46,556 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 26.09 08:19:46" (1/1) ... [2018-09-26 08:19:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:47,082 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:47,083 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:47 BoogieIcfgContainer [2018-09-26 08:19:47,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:47,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:47,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:47,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:47,089 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 26.09 08:19:46" (1/2) ... [2018-09-26 08:19:47,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652a45bf and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:47, skipping insertion in model container [2018-09-26 08:19:47,091 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 26.09 08:19:47" (2/2) ... [2018-09-26 08:19:47,093 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-09-26 08:19:47,104 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:47,113 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:47,164 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:47,165 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:47,165 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:47,165 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:47,166 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:47,166 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:47,166 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:47,166 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:47,167 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-26 08:19:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:19:47,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:47,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:47,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:47,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-09-26 08:19:47,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:47,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:47,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:47,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:47,381 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-26 08:19:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:47,516 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2018-09-26 08:19:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:47,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 08:19:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:47,542 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:19:47,542 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:19:47,549 INFO L605 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-09-26 08:19:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:19:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:19:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:19:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-09-26 08:19:47,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 16 [2018-09-26 08:19:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:47,608 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 54 transitions. [2018-09-26 08:19:47,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 54 transitions. [2018-09-26 08:19:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:19:47,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:47,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:47,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:47,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-09-26 08:19:47,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:47,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:47,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:47,670 INFO L87 Difference]: Start difference. First operand 32 states and 54 transitions. Second operand 3 states. [2018-09-26 08:19:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:47,788 INFO L93 Difference]: Finished difference Result 79 states and 135 transitions. [2018-09-26 08:19:47,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:47,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-26 08:19:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:47,795 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:19:47,796 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:19:47,797 INFO L605 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-09-26 08:19:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:19:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:19:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:19:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 80 transitions. [2018-09-26 08:19:47,825 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 80 transitions. Word has length 24 [2018-09-26 08:19:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 80 transitions. [2018-09-26 08:19:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-09-26 08:19:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:19:47,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:47,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:47,827 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:47,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2072936365, now seen corresponding path program 1 times [2018-09-26 08:19:47,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:47,907 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:47,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:47,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:47,909 INFO L87 Difference]: Start difference. First operand 48 states and 80 transitions. Second operand 3 states. [2018-09-26 08:19:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:47,981 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2018-09-26 08:19:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:47,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-09-26 08:19:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:47,983 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:19:47,984 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:19:47,984 INFO L605 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-09-26 08:19:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:19:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:19:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:19:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2018-09-26 08:19:48,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 29 [2018-09-26 08:19:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,014 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2018-09-26 08:19:48,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2018-09-26 08:19:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:19:48,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,022 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:48,022 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-09-26 08:19:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:48,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:48,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:48,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:48,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:48,057 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand 3 states. [2018-09-26 08:19:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,151 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-09-26 08:19:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:48,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-26 08:19:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,156 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:19:48,156 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:19:48,157 INFO L605 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-09-26 08:19:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:19:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:19:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:19:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-09-26 08:19:48,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 31 [2018-09-26 08:19:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2018-09-26 08:19:48,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2018-09-26 08:19:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:19:48,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,193 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:48,193 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-09-26 08:19:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-26 08:19:48,241 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:48,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:48,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:48,243 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand 3 states. [2018-09-26 08:19:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,329 INFO L93 Difference]: Finished difference Result 149 states and 243 transitions. [2018-09-26 08:19:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:48,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-26 08:19:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,335 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:19:48,335 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:19:48,337 INFO L605 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-09-26 08:19:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:19:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:19:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:19:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2018-09-26 08:19:48,362 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 37 [2018-09-26 08:19:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,362 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2018-09-26 08:19:48,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2018-09-26 08:19:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:19:48,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,365 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:48,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 519658156, now seen corresponding path program 1 times [2018-09-26 08:19:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-26 08:19:48,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:48,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:48,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:48,411 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand 3 states. [2018-09-26 08:19:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,468 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2018-09-26 08:19:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:48,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-26 08:19:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,471 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:19:48,471 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:19:48,474 INFO L605 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-09-26 08:19:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:19:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:19:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:19:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2018-09-26 08:19:48,491 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 41 [2018-09-26 08:19:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,492 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2018-09-26 08:19:48,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2018-09-26 08:19:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:19:48,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,494 INFO L375 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-09-26 08:19:48,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-09-26 08:19:48,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-26 08:19:48,537 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:48,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:48,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:48,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:48,539 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand 3 states. [2018-09-26 08:19:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,611 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2018-09-26 08:19:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:48,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-26 08:19:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,613 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:19:48,613 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:19:48,614 INFO L605 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-09-26 08:19:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:19:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:19:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:19:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2018-09-26 08:19:48,636 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 42 [2018-09-26 08:19:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,636 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2018-09-26 08:19:48,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2018-09-26 08:19:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:19:48,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,641 INFO L375 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-09-26 08:19:48,641 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-09-26 08:19:48,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-26 08:19:48,693 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:48,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:48,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:48,695 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 3 states. [2018-09-26 08:19:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,749 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2018-09-26 08:19:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:48,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-26 08:19:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,751 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:19:48,752 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:19:48,753 INFO L605 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-09-26 08:19:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:19:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:19:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:19:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2018-09-26 08:19:48,795 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 46 [2018-09-26 08:19:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:48,796 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2018-09-26 08:19:48,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2018-09-26 08:19:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:19:48,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:48,798 INFO L375 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-09-26 08:19:48,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:48,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-09-26 08:19:48,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 08:19:48,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:48,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:48,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:48,871 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 4 states. [2018-09-26 08:19:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,999 INFO L93 Difference]: Finished difference Result 520 states and 725 transitions. [2018-09-26 08:19:48,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:48,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-09-26 08:19:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,003 INFO L225 Difference]: With dead ends: 520 [2018-09-26 08:19:49,003 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:19:49,005 INFO L605 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-09-26 08:19:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:19:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 185. [2018-09-26 08:19:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:19:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2018-09-26 08:19:49,054 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 49 [2018-09-26 08:19:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,055 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2018-09-26 08:19:49,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2018-09-26 08:19:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:19:49,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,057 INFO L375 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-09-26 08:19:49,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash -894728562, now seen corresponding path program 1 times [2018-09-26 08:19:49,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-26 08:19:49,110 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,111 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand 3 states. [2018-09-26 08:19:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,167 INFO L93 Difference]: Finished difference Result 280 states and 384 transitions. [2018-09-26 08:19:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-09-26 08:19:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,169 INFO L225 Difference]: With dead ends: 280 [2018-09-26 08:19:49,169 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:19:49,170 INFO L605 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-09-26 08:19:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:19:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:19:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:19:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2018-09-26 08:19:49,202 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 64 [2018-09-26 08:19:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,203 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2018-09-26 08:19:49,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2018-09-26 08:19:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:19:49,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,205 INFO L375 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-09-26 08:19:49,205 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 7017616, now seen corresponding path program 1 times [2018-09-26 08:19:49,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-26 08:19:49,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,252 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand 3 states. [2018-09-26 08:19:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,319 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2018-09-26 08:19:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-26 08:19:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,321 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:19:49,321 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:19:49,322 INFO L605 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-09-26 08:19:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:19:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:19:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:19:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 243 transitions. [2018-09-26 08:19:49,358 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 243 transitions. Word has length 68 [2018-09-26 08:19:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,358 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 243 transitions. [2018-09-26 08:19:49,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-09-26 08:19:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:19:49,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,360 INFO L375 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-09-26 08:19:49,360 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 336193566, now seen corresponding path program 1 times [2018-09-26 08:19:49,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-26 08:19:49,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,416 INFO L87 Difference]: Start difference. First operand 183 states and 243 transitions. Second operand 3 states. [2018-09-26 08:19:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,480 INFO L93 Difference]: Finished difference Result 359 states and 478 transitions. [2018-09-26 08:19:49,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-09-26 08:19:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,482 INFO L225 Difference]: With dead ends: 359 [2018-09-26 08:19:49,482 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:19:49,483 INFO L605 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-09-26 08:19:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:19:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:19:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:19:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2018-09-26 08:19:49,518 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 73 [2018-09-26 08:19:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,519 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2018-09-26 08:19:49,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2018-09-26 08:19:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:19:49,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,521 INFO L375 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-09-26 08:19:49,521 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1875725862, now seen corresponding path program 1 times [2018-09-26 08:19:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-26 08:19:49,569 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,571 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand 3 states. [2018-09-26 08:19:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,629 INFO L93 Difference]: Finished difference Result 356 states and 465 transitions. [2018-09-26 08:19:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-09-26 08:19:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,631 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:19:49,631 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:19:49,632 INFO L605 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-09-26 08:19:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:19:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:19:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:19:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2018-09-26 08:19:49,667 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 79 [2018-09-26 08:19:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2018-09-26 08:19:49,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2018-09-26 08:19:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:19:49,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,669 INFO L375 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-09-26 08:19:49,676 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1352640754, now seen corresponding path program 1 times [2018-09-26 08:19:49,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:19:49,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,745 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand 3 states. [2018-09-26 08:19:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,805 INFO L93 Difference]: Finished difference Result 356 states and 457 transitions. [2018-09-26 08:19:49,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-26 08:19:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,807 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:19:49,807 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:19:49,810 INFO L605 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-09-26 08:19:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:19:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:19:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:19:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2018-09-26 08:19:49,845 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 86 [2018-09-26 08:19:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,845 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2018-09-26 08:19:49,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2018-09-26 08:19:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:19:49,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,847 INFO L375 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-09-26 08:19:49,847 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1366483836, now seen corresponding path program 1 times [2018-09-26 08:19:49,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-26 08:19:49,906 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:49,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:49,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:49,908 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 3 states. [2018-09-26 08:19:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:49,970 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2018-09-26 08:19:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:49,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-09-26 08:19:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:49,972 INFO L225 Difference]: With dead ends: 378 [2018-09-26 08:19:49,973 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:19:49,974 INFO L605 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-09-26 08:19:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:19:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:19:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:19:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2018-09-26 08:19:50,009 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 94 [2018-09-26 08:19:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:50,010 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2018-09-26 08:19:50,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2018-09-26 08:19:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:19:50,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:50,012 INFO L375 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-09-26 08:19:50,012 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:50,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 655809876, now seen corresponding path program 1 times [2018-09-26 08:19:50,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-09-26 08:19:50,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:50,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:50,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:50,130 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand 4 states. [2018-09-26 08:19:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:50,247 INFO L93 Difference]: Finished difference Result 587 states and 729 transitions. [2018-09-26 08:19:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:50,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-09-26 08:19:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:50,251 INFO L225 Difference]: With dead ends: 587 [2018-09-26 08:19:50,251 INFO L226 Difference]: Without dead ends: 484 [2018-09-26 08:19:50,252 INFO L605 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-09-26 08:19:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-09-26 08:19:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 294. [2018-09-26 08:19:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-26 08:19:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2018-09-26 08:19:50,389 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 104 [2018-09-26 08:19:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:50,390 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2018-09-26 08:19:50,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2018-09-26 08:19:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:19:50,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:50,397 INFO L375 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-09-26 08:19:50,398 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:50,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -368721125, now seen corresponding path program 2 times [2018-09-26 08:19:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-26 08:19:50,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:50,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:50,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:50,520 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand 3 states. [2018-09-26 08:19:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:50,602 INFO L93 Difference]: Finished difference Result 580 states and 723 transitions. [2018-09-26 08:19:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:50,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-09-26 08:19:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:50,604 INFO L225 Difference]: With dead ends: 580 [2018-09-26 08:19:50,605 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:19:50,605 INFO L605 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-09-26 08:19:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:19:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-09-26 08:19:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-26 08:19:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 352 transitions. [2018-09-26 08:19:50,664 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 352 transitions. Word has length 140 [2018-09-26 08:19:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:50,665 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 352 transitions. [2018-09-26 08:19:50,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 352 transitions. [2018-09-26 08:19:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:19:50,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:50,667 INFO L375 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-09-26 08:19:50,668 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:50,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 619884813, now seen corresponding path program 1 times [2018-09-26 08:19:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 737 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-26 08:19:50,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:50,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:50,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:50,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:50,763 INFO L87 Difference]: Start difference. First operand 294 states and 352 transitions. Second operand 4 states. [2018-09-26 08:19:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:50,844 INFO L93 Difference]: Finished difference Result 492 states and 592 transitions. [2018-09-26 08:19:50,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:50,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-09-26 08:19:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:50,845 INFO L225 Difference]: With dead ends: 492 [2018-09-26 08:19:50,845 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:50,846 INFO L605 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-09-26 08:19:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:50,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-09-26 08:19:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:50,847 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:50,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:50,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:50,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:50,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:50,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:51,991 INFO L426 ceAbstractionStarter]: For program point L444(lines 441 466) no Hoare annotation was computed. [2018-09-26 08:19:51,993 INFO L422 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-09-26 08:19:51,993 INFO L422 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-09-26 08:19:51,993 INFO L426 ceAbstractionStarter]: For program point L457(lines 457 478) no Hoare annotation was computed. [2018-09-26 08:19:51,994 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-26 08:19:51,994 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 517) the Hoare annotation is: true [2018-09-26 08:19:51,994 INFO L422 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-09-26 08:19:51,995 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-09-26 08:19:51,995 INFO L422 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-09-26 08:19:51,996 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) the Hoare annotation is: false [2018-09-26 08:19:51,996 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 517) the Hoare annotation is: false [2018-09-26 08:19:51,996 INFO L422 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-09-26 08:19:51,997 INFO L422 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-09-26 08:19:51,998 INFO L422 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-09-26 08:19:51,999 INFO L422 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-09-26 08:19:51,999 INFO L422 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-09-26 08:19:51,999 INFO L426 ceAbstractionStarter]: For program point L480(lines 477 490) no Hoare annotation was computed. [2018-09-26 08:19:52,000 INFO L422 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-09-26 08:19:52,001 INFO L422 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-09-26 08:19:52,001 INFO L422 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-09-26 08:19:52,002 INFO L422 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-09-26 08:19:52,002 INFO L426 ceAbstractionStarter]: For program point L431(lines 431 442) no Hoare annotation was computed. [2018-09-26 08:19:52,002 INFO L422 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-09-26 08:19:52,003 INFO L422 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-09-26 08:19:52,003 INFO L422 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) [2018-09-26 08:19:52,038 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:52 BoogieIcfgContainer [2018-09-26 08:19:52,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:52,040 INFO L168 Benchmark]: Toolchain (without parser) took 5572.79 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 371.4 MB). Peak memory consumption was 428.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:52,043 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:52,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:52,049 INFO L168 Benchmark]: Boogie Preprocessor took 39.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:52,049 INFO L168 Benchmark]: RCFGBuilder took 528.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:52,050 INFO L168 Benchmark]: TraceAbstraction took 4954.17 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 350.3 MB). Peak memory consumption was 407.4 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:52,055 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 528.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4954.17 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 350.3 MB). Peak memory consumption was 407.4 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: 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: 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: 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: 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: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 - 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)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - 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: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - 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: 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: 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: 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: 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: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 139 SDslu, 168 SDs, 0 SdLazy, 587 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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.5s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5432 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s 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_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-52-081.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-52-081.csv Received shutdown request...