java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:50,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:50,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:50,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:50,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:50,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:50,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:50,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:50,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:50,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:50,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:50,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:50,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:50,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:50,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:50,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:50,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:50,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:50,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:50,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:50,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:50,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:50,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:50,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:50,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:50,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:50,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:50,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:50,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:50,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:50,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:50,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:50,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:50,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:50,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:50,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:50,307 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:19:50,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:50,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:50,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:50,323 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:50,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:50,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:50,324 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:50,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:50,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:50,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:50,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:50,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:50,420 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:50,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-09-26 08:19:50,421 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-09-26 08:19:50,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:50,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:50,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:50,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:50,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:50,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:50,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:50,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:50,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:50,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:50,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:50,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:50,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/1) ... [2018-09-26 08:19:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:50,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:51,213 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:51,213 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:51 BoogieIcfgContainer [2018-09-26 08:19:51,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:51,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:51,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:51,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:50" (1/2) ... [2018-09-26 08:19:51,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e974fdd and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:51, skipping insertion in model container [2018-09-26 08:19:51,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:51" (2/2) ... [2018-09-26 08:19:51,227 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-09-26 08:19:51,237 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:51,251 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:51,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:51,304 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:51,304 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:51,304 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:51,305 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:51,305 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:51,305 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:51,305 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:51,305 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-26 08:19:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:19:51,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:51,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:51,344 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:51,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-09-26 08:19:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:51,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:51,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:51,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:51,513 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-26 08:19:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:51,661 INFO L93 Difference]: Finished difference Result 47 states and 81 transitions. [2018-09-26 08:19:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:51,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 08:19:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:51,693 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:19:51,694 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:19:51,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:19:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:19:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:19:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2018-09-26 08:19:51,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 15 [2018-09-26 08:19:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:51,746 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2018-09-26 08:19:51,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2018-09-26 08:19:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:19:51,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:51,748 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:51,748 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:51,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-09-26 08:19:51,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:51,790 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:51,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:51,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:51,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:51,799 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 3 states. [2018-09-26 08:19:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:51,895 INFO L93 Difference]: Finished difference Result 75 states and 129 transitions. [2018-09-26 08:19:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:51,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-26 08:19:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:51,897 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:19:51,897 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:19:51,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:19:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:19:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:19:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-09-26 08:19:51,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 23 [2018-09-26 08:19:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:51,930 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-09-26 08:19:51,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-09-26 08:19:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:51,932 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:51,932 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:51,933 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:51,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1107910457, now seen corresponding path program 1 times [2018-09-26 08:19:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:51,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:51,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:51,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,002 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-09-26 08:19:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,116 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2018-09-26 08:19:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 08:19:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,121 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:19:52,122 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:19:52,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:19:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:19:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:19:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 106 transitions. [2018-09-26 08:19:52,156 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 106 transitions. Word has length 28 [2018-09-26 08:19:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,157 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 106 transitions. [2018-09-26 08:19:52,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 106 transitions. [2018-09-26 08:19:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:19:52,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,164 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-09-26 08:19:52,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:52,215 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:52,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:52,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,217 INFO L87 Difference]: Start difference. First operand 63 states and 106 transitions. Second operand 3 states. [2018-09-26 08:19:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,324 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2018-09-26 08:19:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 08:19:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,329 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:19:52,331 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:19:52,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:19:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:19:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:19:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2018-09-26 08:19:52,354 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 30 [2018-09-26 08:19:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,355 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2018-09-26 08:19:52,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2018-09-26 08:19:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:19:52,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,357 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,357 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-09-26 08:19:52,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-26 08:19:52,390 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:52,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:52,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,393 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand 3 states. [2018-09-26 08:19:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,439 INFO L93 Difference]: Finished difference Result 145 states and 237 transitions. [2018-09-26 08:19:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-26 08:19:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,441 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:19:52,442 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:19:52,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:19:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:19:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:19:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2018-09-26 08:19:52,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 36 [2018-09-26 08:19:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2018-09-26 08:19:52,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2018-09-26 08:19:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:19:52,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,462 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,462 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1742811576, now seen corresponding path program 1 times [2018-09-26 08:19:52,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-26 08:19:52,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:52,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:52,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,497 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand 3 states. [2018-09-26 08:19:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,548 INFO L93 Difference]: Finished difference Result 163 states and 255 transitions. [2018-09-26 08:19:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-26 08:19:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,550 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:19:52,550 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:19:52,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:19:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:19:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:19:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2018-09-26 08:19:52,573 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 40 [2018-09-26 08:19:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,573 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2018-09-26 08:19:52,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2018-09-26 08:19:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:19:52,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,578 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,578 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-09-26 08:19:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-26 08:19:52,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:52,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,616 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand 3 states. [2018-09-26 08:19:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,678 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2018-09-26 08:19:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-26 08:19:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,679 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:19:52,680 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:19:52,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:19:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:19:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:19:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2018-09-26 08:19:52,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 41 [2018-09-26 08:19:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,713 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2018-09-26 08:19:52,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2018-09-26 08:19:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:19:52,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,719 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,723 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-09-26 08:19:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-26 08:19:52,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:52,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:52,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:52,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:52,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,771 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand 3 states. [2018-09-26 08:19:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:52,833 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2018-09-26 08:19:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:52,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-26 08:19:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:52,835 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:19:52,835 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:19:52,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:19:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:19:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:19:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2018-09-26 08:19:52,860 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 45 [2018-09-26 08:19:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:52,860 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2018-09-26 08:19:52,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2018-09-26 08:19:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:19:52,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:52,867 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:52,867 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:52,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-09-26 08:19:52,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 08:19:52,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:52,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:52,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:52,925 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand 4 states. [2018-09-26 08:19:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,075 INFO L93 Difference]: Finished difference Result 282 states and 382 transitions. [2018-09-26 08:19:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:53,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-09-26 08:19:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,080 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:19:53,080 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:19:53,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:19:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2018-09-26 08:19:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:19:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-09-26 08:19:53,119 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 48 [2018-09-26 08:19:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,120 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-09-26 08:19:53,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-09-26 08:19:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:19:53,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,122 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,129 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -572978626, now seen corresponding path program 1 times [2018-09-26 08:19:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-26 08:19:53,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,178 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 3 states. [2018-09-26 08:19:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,252 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2018-09-26 08:19:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-26 08:19:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,253 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:19:53,254 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:19:53,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:19:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:19:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:19:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2018-09-26 08:19:53,280 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 60 [2018-09-26 08:19:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,280 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2018-09-26 08:19:53,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2018-09-26 08:19:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:19:53,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,282 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,283 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -396241696, now seen corresponding path program 1 times [2018-09-26 08:19:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-26 08:19:53,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:53,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,342 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand 3 states. [2018-09-26 08:19:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,391 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2018-09-26 08:19:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-09-26 08:19:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,393 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:19:53,393 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:19:53,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:19:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:19:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:19:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-09-26 08:19:53,417 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 93 [2018-09-26 08:19:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-09-26 08:19:53,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-09-26 08:19:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:19:53,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,419 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385072, now seen corresponding path program 1 times [2018-09-26 08:19:53,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-09-26 08:19:53,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:53,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:53,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:53,518 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 4 states. [2018-09-26 08:19:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,595 INFO L93 Difference]: Finished difference Result 259 states and 315 transitions. [2018-09-26 08:19:53,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:53,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-09-26 08:19:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,600 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:19:53,600 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:19:53,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:19:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2018-09-26 08:19:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:19:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2018-09-26 08:19:53,660 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 103 [2018-09-26 08:19:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,660 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2018-09-26 08:19:53,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2018-09-26 08:19:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:19:53,665 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,665 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash -742527895, now seen corresponding path program 2 times [2018-09-26 08:19:53,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-26 08:19:53,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,785 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand 3 states. [2018-09-26 08:19:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,861 INFO L93 Difference]: Finished difference Result 385 states and 469 transitions. [2018-09-26 08:19:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-09-26 08:19:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,864 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:19:53,864 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:19:53,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:19:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:19:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:19:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-09-26 08:19:53,913 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 139 [2018-09-26 08:19:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-09-26 08:19:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-09-26 08:19:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:19:53,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,917 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,917 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1179294915, now seen corresponding path program 1 times [2018-09-26 08:19:53,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-26 08:19:54,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:54,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:54,068 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 4 states. [2018-09-26 08:19:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,152 INFO L93 Difference]: Finished difference Result 332 states and 398 transitions. [2018-09-26 08:19:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:54,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-09-26 08:19:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,153 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:19:54,153 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:54,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:54,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2018-09-26 08:19:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:54,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:54,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:54,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:54,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:55,082 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 427) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-09-26 08:19:55,083 INFO L422 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-09-26 08:19:55,084 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 378) the Hoare annotation is: (let ((.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse6)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5 .cse6))) [2018-09-26 08:19:55,085 INFO L422 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-09-26 08:19:55,085 INFO L426 ceAbstractionStarter]: For program point L461(lines 461 482) no Hoare annotation was computed. [2018-09-26 08:19:55,085 INFO L422 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-09-26 08:19:55,085 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) the Hoare annotation is: false [2018-09-26 08:19:55,086 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-09-26 08:19:55,086 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-09-26 08:19:55,087 INFO L422 ceAbstractionStarter]: At program point L313(lines 313 324) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse4 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) [2018-09-26 08:19:55,088 INFO L422 ceAbstractionStarter]: At program point L400(lines 400 412) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-09-26 08:19:55,088 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 507) the Hoare annotation is: false [2018-09-26 08:19:55,089 INFO L422 ceAbstractionStarter]: At program point L380(lines 380 397) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-26 08:19:55,090 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 365) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse6 .cse5 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5))) [2018-09-26 08:19:55,090 INFO L422 ceAbstractionStarter]: At program point L442(lines 442 462) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5))))) [2018-09-26 08:19:55,091 INFO L422 ceAbstractionStarter]: At program point L504(lines 286 504) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-09-26 08:19:55,091 INFO L426 ceAbstractionStarter]: For program point L438(lines 438 449) no Hoare annotation was computed. [2018-09-26 08:19:55,092 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 439) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 .cse2))) [2018-09-26 08:19:55,092 INFO L422 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-09-26 08:19:55,093 INFO L426 ceAbstractionStarter]: For program point L484(lines 481 499) no Hoare annotation was computed. [2018-09-26 08:19:55,093 INFO L426 ceAbstractionStarter]: For program point L451(lines 448 470) no Hoare annotation was computed. [2018-09-26 08:19:55,093 INFO L422 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-09-26 08:19:55,094 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse4 .cse1 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-26 08:19:55,116 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:55 BoogieIcfgContainer [2018-09-26 08:19:55,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:55,117 INFO L168 Benchmark]: Toolchain (without parser) took 4587.66 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 49.3 MB). Peak memory consumption was 500.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,119 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:55,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:55,121 INFO L168 Benchmark]: Boogie Preprocessor took 63.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:55,121 INFO L168 Benchmark]: RCFGBuilder took 560.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,122 INFO L168 Benchmark]: TraceAbstraction took 3901.04 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.6 MB). Peak memory consumption was 469.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,130 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.72 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 63.77 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 560.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3901.04 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.6 MB). Peak memory consumption was 469.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8656 == ssl3_accept_~s__state~5) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3 && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (!(8576 == ssl3_accept_~s__state~5) && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 117 SDslu, 97 SDs, 0 SdLazy, 487 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 144 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 174 NumberOfFragments, 915 HoareAnnotationTreeSize, 18 FomulaSimplifications, 6403 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3244 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 123055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3067/3164 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_3.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-55-149.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-55-149.csv Received shutdown request...