java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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-e6fd87c [2018-07-25 13:29:04,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:29:04,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:04,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:04,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:04,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:04,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:04,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:04,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:04,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:04,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:04,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:04,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:04,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:04,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:04,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:04,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:04,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:04,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:04,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:04,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:04,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:04,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:04,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:04,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:04,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:04,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:04,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:04,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:04,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:04,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:04,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:04,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:04,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:04,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:04,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:04,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:29:04,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:04,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:04,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:04,863 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:04,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:04,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:04,863 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:04,864 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:04,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:04,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:04,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:04,951 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:04,952 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:04,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-07-25 13:29:04,953 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-07-25 13:29:05,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:05,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:05,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:05,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:05,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:05,079 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,096 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:05,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:05,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:05,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:05,125 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,125 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,136 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,137 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,153 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,160 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,167 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:05,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:05,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:05,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:05,179 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 25.07 01:29:05" (1/1) ... [2018-07-25 13:29:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:05,738 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:05,738 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:05 BoogieIcfgContainer [2018-07-25 13:29:05,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:05,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:05,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:05,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:05,745 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 25.07 01:29:05" (1/2) ... [2018-07-25 13:29:05,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f215e42 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:05, skipping insertion in model container [2018-07-25 13:29:05,746 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 25.07 01:29:05" (2/2) ... [2018-07-25 13:29:05,749 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-07-25 13:29:05,760 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:05,769 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:05,819 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:05,820 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:05,820 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:05,820 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:05,820 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:05,821 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:05,821 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:05,821 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:05,821 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-07-25 13:29:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:29:05,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:05,849 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:05,850 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-07-25 13:29:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:05,983 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:05,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:05,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:06,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:06,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,008 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-07-25 13:29:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,166 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2018-07-25 13:29:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:06,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-07-25 13:29:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,203 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:29:06,204 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:29:06,212 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:29:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:29:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:29:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-07-25 13:29:06,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 16 [2018-07-25 13:29:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,276 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 54 transitions. [2018-07-25 13:29:06,276 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 54 transitions. [2018-07-25 13:29:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:29:06,277 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,278 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:06,278 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-07-25 13:29:06,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:06,320 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:06,320 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:06,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:06,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:06,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,323 INFO L87 Difference]: Start difference. First operand 32 states and 54 transitions. Second operand 3 states. [2018-07-25 13:29:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,441 INFO L93 Difference]: Finished difference Result 79 states and 135 transitions. [2018-07-25 13:29:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:06,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-07-25 13:29:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,445 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:29:06,445 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:29:06,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:29:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:29:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:29:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 80 transitions. [2018-07-25 13:29:06,473 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 80 transitions. Word has length 24 [2018-07-25 13:29:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,474 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 80 transitions. [2018-07-25 13:29:06,474 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-07-25 13:29:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:29:06,475 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,476 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:06,476 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2072936365, now seen corresponding path program 1 times [2018-07-25 13:29:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:06,539 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:06,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:06,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:06,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:06,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,544 INFO L87 Difference]: Start difference. First operand 48 states and 80 transitions. Second operand 3 states. [2018-07-25 13:29:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,679 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2018-07-25 13:29:06,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:06,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-07-25 13:29:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,683 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:29:06,683 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:29:06,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:29:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:29:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:29:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2018-07-25 13:29:06,722 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 29 [2018-07-25 13:29:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,722 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2018-07-25 13:29:06,722 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2018-07-25 13:29:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:29:06,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,728 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:06,728 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-07-25 13:29:06,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 13:29:06,787 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:06,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:06,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:06,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:06,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,790 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand 3 states. [2018-07-25 13:29:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,864 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-25 13:29:06,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:06,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-07-25 13:29:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,872 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:29:06,873 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:29:06,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:29:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:29:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:29:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-07-25 13:29:06,901 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 31 [2018-07-25 13:29:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,904 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2018-07-25 13:29:06,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2018-07-25 13:29:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:29:06,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,907 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:06,908 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-07-25 13:29:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-25 13:29:06,944 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:06,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:06,944 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:06,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:06,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:06,947 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand 3 states. [2018-07-25 13:29:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,995 INFO L93 Difference]: Finished difference Result 149 states and 243 transitions. [2018-07-25 13:29:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:06,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-07-25 13:29:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,001 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:29:07,001 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:29:07,003 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:29:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:29:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:29:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2018-07-25 13:29:07,030 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 37 [2018-07-25 13:29:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,031 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2018-07-25 13:29:07,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2018-07-25 13:29:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:29:07,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,036 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,037 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 519658156, now seen corresponding path program 1 times [2018-07-25 13:29:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-25 13:29:07,083 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:07,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:07,084 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:07,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:07,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,085 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand 3 states. [2018-07-25 13:29:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,183 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2018-07-25 13:29:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:07,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-25 13:29:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,185 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:29:07,185 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:29:07,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:29:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:29:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:29:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2018-07-25 13:29:07,214 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 41 [2018-07-25 13:29:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,216 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2018-07-25 13:29:07,216 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2018-07-25 13:29:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:29:07,218 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,219 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,219 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-07-25 13:29:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-25 13:29:07,270 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:07,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:07,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:07,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:07,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,272 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand 3 states. [2018-07-25 13:29:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,321 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2018-07-25 13:29:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:07,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-07-25 13:29:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,324 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:29:07,324 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:29:07,325 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:29:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:29:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:29:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2018-07-25 13:29:07,346 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 42 [2018-07-25 13:29:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,346 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2018-07-25 13:29:07,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2018-07-25 13:29:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:29:07,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,348 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,349 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-07-25 13:29:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-25 13:29:07,388 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:07,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:07,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:07,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:07,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,391 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 3 states. [2018-07-25 13:29:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,431 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2018-07-25 13:29:07,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:07,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-07-25 13:29:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,433 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:29:07,434 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 13:29:07,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 13:29:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 13:29:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:29:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2018-07-25 13:29:07,470 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 46 [2018-07-25 13:29:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,470 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2018-07-25 13:29:07,470 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2018-07-25 13:29:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:29:07,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,472 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,473 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-07-25 13:29:07,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-25 13:29:07,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:07,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:07,544 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:07,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:07,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:07,549 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 4 states. [2018-07-25 13:29:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,722 INFO L93 Difference]: Finished difference Result 520 states and 725 transitions. [2018-07-25 13:29:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:07,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-07-25 13:29:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,726 INFO L225 Difference]: With dead ends: 520 [2018-07-25 13:29:07,726 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:29:07,727 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:29:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 185. [2018-07-25 13:29:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:29:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2018-07-25 13:29:07,770 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 49 [2018-07-25 13:29:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,770 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2018-07-25 13:29:07,770 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2018-07-25 13:29:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:29:07,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,772 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,775 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash -894728562, now seen corresponding path program 1 times [2018-07-25 13:29:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-25 13:29:07,831 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:07,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:07,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:07,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:07,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,833 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand 3 states. [2018-07-25 13:29:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,894 INFO L93 Difference]: Finished difference Result 280 states and 384 transitions. [2018-07-25 13:29:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:07,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-07-25 13:29:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,896 INFO L225 Difference]: With dead ends: 280 [2018-07-25 13:29:07,896 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:29:07,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:29:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 13:29:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:29:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2018-07-25 13:29:07,932 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 64 [2018-07-25 13:29:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,933 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2018-07-25 13:29:07,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2018-07-25 13:29:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:29:07,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,935 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:07,935 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash 7017616, now seen corresponding path program 1 times [2018-07-25 13:29:07,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-07-25 13:29:07,979 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:07,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:07,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:07,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:07,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:07,981 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand 3 states. [2018-07-25 13:29:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,036 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2018-07-25 13:29:08,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:08,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-07-25 13:29:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,037 INFO L225 Difference]: With dead ends: 278 [2018-07-25 13:29:08,038 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:29:08,039 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:29:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:29:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:29:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 243 transitions. [2018-07-25 13:29:08,072 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 243 transitions. Word has length 68 [2018-07-25 13:29:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,072 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 243 transitions. [2018-07-25 13:29:08,073 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-07-25 13:29:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:29:08,074 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,074 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:08,074 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash 336193566, now seen corresponding path program 1 times [2018-07-25 13:29:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-25 13:29:08,118 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:08,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:08,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:08,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:08,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,120 INFO L87 Difference]: Start difference. First operand 183 states and 243 transitions. Second operand 3 states. [2018-07-25 13:29:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,184 INFO L93 Difference]: Finished difference Result 359 states and 478 transitions. [2018-07-25 13:29:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:08,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-07-25 13:29:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,186 INFO L225 Difference]: With dead ends: 359 [2018-07-25 13:29:08,187 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 13:29:08,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 13:29:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 13:29:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:29:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2018-07-25 13:29:08,220 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 73 [2018-07-25 13:29:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,221 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2018-07-25 13:29:08,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2018-07-25 13:29:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:29:08,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,222 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:08,223 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1875725862, now seen corresponding path program 1 times [2018-07-25 13:29:08,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-25 13:29:08,270 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:08,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:08,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:08,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:08,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,272 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand 3 states. [2018-07-25 13:29:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,333 INFO L93 Difference]: Finished difference Result 356 states and 465 transitions. [2018-07-25 13:29:08,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:08,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-07-25 13:29:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,335 INFO L225 Difference]: With dead ends: 356 [2018-07-25 13:29:08,335 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:29:08,336 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:29:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:29:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:29:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2018-07-25 13:29:08,371 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 79 [2018-07-25 13:29:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,371 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2018-07-25 13:29:08,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2018-07-25 13:29:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:29:08,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,373 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:08,373 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1352640754, now seen corresponding path program 1 times [2018-07-25 13:29:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:08,444 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:08,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:08,445 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:08,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:08,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,446 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand 3 states. [2018-07-25 13:29:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,507 INFO L93 Difference]: Finished difference Result 356 states and 457 transitions. [2018-07-25 13:29:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:08,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-07-25 13:29:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,509 INFO L225 Difference]: With dead ends: 356 [2018-07-25 13:29:08,509 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:29:08,511 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:29:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:29:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:29:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2018-07-25 13:29:08,543 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 86 [2018-07-25 13:29:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,544 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2018-07-25 13:29:08,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2018-07-25 13:29:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:29:08,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,546 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:08,546 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1366483836, now seen corresponding path program 1 times [2018-07-25 13:29:08,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-25 13:29:08,605 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:08,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:08,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:08,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:08,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,607 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 3 states. [2018-07-25 13:29:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,674 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2018-07-25 13:29:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:08,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-07-25 13:29:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,677 INFO L225 Difference]: With dead ends: 378 [2018-07-25 13:29:08,677 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:29:08,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:29:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:29:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:29:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2018-07-25 13:29:08,716 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 94 [2018-07-25 13:29:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,716 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2018-07-25 13:29:08,716 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2018-07-25 13:29:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:29:08,718 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,718 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:08,718 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash 655809876, now seen corresponding path program 1 times [2018-07-25 13:29:08,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-25 13:29:08,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:08,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:08,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:08,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:08,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:08,824 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand 4 states. [2018-07-25 13:29:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,940 INFO L93 Difference]: Finished difference Result 587 states and 729 transitions. [2018-07-25 13:29:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:08,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-07-25 13:29:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,944 INFO L225 Difference]: With dead ends: 587 [2018-07-25 13:29:08,944 INFO L226 Difference]: Without dead ends: 484 [2018-07-25 13:29:08,945 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-07-25 13:29:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 294. [2018-07-25 13:29:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-25 13:29:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2018-07-25 13:29:09,013 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 104 [2018-07-25 13:29:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:09,014 INFO L472 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2018-07-25 13:29:09,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2018-07-25 13:29:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:29:09,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:09,017 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:09,017 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash -368721125, now seen corresponding path program 2 times [2018-07-25 13:29:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-25 13:29:09,214 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:09,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:09,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:09,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:09,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:09,215 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand 3 states. [2018-07-25 13:29:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:09,311 INFO L93 Difference]: Finished difference Result 580 states and 723 transitions. [2018-07-25 13:29:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:09,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-07-25 13:29:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:09,314 INFO L225 Difference]: With dead ends: 580 [2018-07-25 13:29:09,314 INFO L226 Difference]: Without dead ends: 294 [2018-07-25 13:29:09,315 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-25 13:29:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-07-25 13:29:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-25 13:29:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 352 transitions. [2018-07-25 13:29:09,372 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 352 transitions. Word has length 140 [2018-07-25 13:29:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:09,375 INFO L472 AbstractCegarLoop]: Abstraction has 294 states and 352 transitions. [2018-07-25 13:29:09,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 352 transitions. [2018-07-25 13:29:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:29:09,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:09,379 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:09,379 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 619884813, now seen corresponding path program 1 times [2018-07-25 13:29:09,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 737 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-25 13:29:09,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:09,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:09,488 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:09,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:09,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:09,489 INFO L87 Difference]: Start difference. First operand 294 states and 352 transitions. Second operand 4 states. [2018-07-25 13:29:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:09,571 INFO L93 Difference]: Finished difference Result 492 states and 592 transitions. [2018-07-25 13:29:09,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:09,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-07-25 13:29:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:09,575 INFO L225 Difference]: With dead ends: 492 [2018-07-25 13:29:09,575 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:29:09,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:29:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:29:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:29:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:29:09,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-07-25 13:29:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:09,578 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:29:09,578 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:29:09,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:29:09,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:29:09,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,697 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 67 [2018-07-25 13:29:09,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:09,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:10,814 INFO L422 ceAbstractionStarter]: For program point L444(lines 441 466) no Hoare annotation was computed. [2018-07-25 13:29:10,816 INFO L418 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2) (and .cse3 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,816 INFO L418 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-25 13:29:10,816 INFO L422 ceAbstractionStarter]: For program point L457(lines 457 478) no Hoare annotation was computed. [2018-07-25 13:29:10,817 INFO L418 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-07-25 13:29:10,817 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 517) the Hoare annotation is: true [2018-07-25 13:29:10,818 INFO L418 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,818 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-07-25 13:29:10,819 INFO L418 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-25 13:29:10,819 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) the Hoare annotation is: false [2018-07-25 13:29:10,821 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 517) the Hoare annotation is: false [2018-07-25 13:29:10,822 INFO L418 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,823 INFO L418 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,823 INFO L418 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-25 13:29:10,824 INFO L418 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3 .cse4) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3 .cse4))) [2018-07-25 13:29:10,825 INFO L418 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,825 INFO L422 ceAbstractionStarter]: For program point L480(lines 477 490) no Hoare annotation was computed. [2018-07-25 13:29:10,829 INFO L418 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,830 INFO L418 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) [2018-07-25 13:29:10,833 INFO L418 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-25 13:29:10,833 INFO L418 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 13:29:10,836 INFO L422 ceAbstractionStarter]: For program point L431(lines 431 442) no Hoare annotation was computed. [2018-07-25 13:29:10,836 INFO L418 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-25 13:29:10,837 INFO L418 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-25 13:29:10,837 INFO L418 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) [2018-07-25 13:29:10,869 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:10 BoogieIcfgContainer [2018-07-25 13:29:10,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:10,870 INFO L168 Benchmark]: Toolchain (without parser) took 5814.65 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 77.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 339.1 MB). Peak memory consumption was 416.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:10,875 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-07-25 13:29:10,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.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-07-25 13:29:10,876 INFO L168 Benchmark]: Boogie Preprocessor took 64.41 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-07-25 13:29:10,880 INFO L168 Benchmark]: RCFGBuilder took 561.00 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-07-25 13:29:10,881 INFO L168 Benchmark]: TraceAbstraction took 5128.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 77.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 318.0 MB). Peak memory consumption was 395.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:10,887 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 55.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 Preprocessor took 64.41 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 561.00 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 5128.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 77.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 318.0 MB). Peak memory consumption was 395.6 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, 5.0s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 139 SDslu, 168 SDs, 0 SdLazy, 587 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 243 NumberOfFragments, 574 HoareAnnotationTreeSize, 20 FomulaSimplifications, 13235 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5432 FormulaSimplificationTreeSizeReductionInter, 0.4s 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-07-25_13-29-10-915.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-07-25_13-29-10-915.csv Received shutdown request...