java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:19,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:19,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:19,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:19,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:19,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:19,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:19,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:19,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:19,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:19,942 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:19,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:19,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:19,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:19,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:19,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:19,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:19,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:19,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:19,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:19,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:19,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:19,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:19,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:19,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:19,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:19,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:19,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:19,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:19,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:19,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:19,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:19,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:19,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:19,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:19,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:19,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:19,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:19,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:19,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:19,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:20,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:20,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:20,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:20,052 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:20,053 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:20,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2019-08-05 10:15:20,054 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2019-08-05 10:15:20,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:20,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:20,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:20,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:20,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:20,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:20,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:20,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:20,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:20,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... [2019-08-05 10:15:20,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:20,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:20,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:20,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:20,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:15:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:20,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:21,039 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:21,039 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:15:21,041 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:21 BoogieIcfgContainer [2019-08-05 10:15:21,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:21,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:21,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:21,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:21,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:20" (1/2) ... [2019-08-05 10:15:21,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fab53b2 and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:21, skipping insertion in model container [2019-08-05 10:15:21,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:21" (2/2) ... [2019-08-05 10:15:21,049 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2019-08-05 10:15:21,059 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:21,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:21,083 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:21,109 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:21,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:21,110 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:21,110 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:21,110 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:21,110 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:21,111 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:21,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:21,111 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 10:15:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:15:21,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:21,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:21,139 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2019-08-05 10:15:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:21,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:21,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:21,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:21,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:21,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:21,375 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 10:15:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:21,504 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2019-08-05 10:15:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:21,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:15:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:21,532 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:15:21,532 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:15:21,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:15:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:15:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:15:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2019-08-05 10:15:21,570 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 15 [2019-08-05 10:15:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:21,571 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2019-08-05 10:15:21,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2019-08-05 10:15:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:15:21,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:21,572 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:21,573 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash 994659063, now seen corresponding path program 1 times [2019-08-05 10:15:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:21,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:21,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:21,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:21,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:21,675 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 3 states. [2019-08-05 10:15:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:21,980 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2019-08-05 10:15:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:21,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 10:15:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:21,983 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:15:21,983 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:15:21,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:15:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:15:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:15:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-08-05 10:15:22,000 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 18 [2019-08-05 10:15:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,003 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-08-05 10:15:22,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-08-05 10:15:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:15:22,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,009 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:22,013 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1054659463, now seen corresponding path program 1 times [2019-08-05 10:15:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:15:22,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:22,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:22,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:22,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,124 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 3 states. [2019-08-05 10:15:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,332 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-08-05 10:15:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:22,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:15:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,334 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:15:22,334 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:15:22,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:15:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:15:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:15:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:15:22,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 22 [2019-08-05 10:15:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,342 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:15:22,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:15:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:15:22,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,344 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:22,344 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1471998087, now seen corresponding path program 1 times [2019-08-05 10:15:22,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:15:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:22,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:22,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,426 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:15:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,676 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-08-05 10:15:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:22,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:15:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,679 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:15:22,679 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:15:22,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:15:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:15:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:15:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-08-05 10:15:22,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 27 [2019-08-05 10:15:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,687 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-08-05 10:15:22,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2019-08-05 10:15:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:15:22,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,689 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:22,689 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1270422339, now seen corresponding path program 1 times [2019-08-05 10:15:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 10:15:22,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:22,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:22,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,762 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand 3 states. [2019-08-05 10:15:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,906 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-08-05 10:15:22,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:22,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-08-05 10:15:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,910 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:15:22,910 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:15:22,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:15:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:15:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:15:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-08-05 10:15:22,918 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 33 [2019-08-05 10:15:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,918 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-08-05 10:15:22,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-08-05 10:15:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:15:22,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,920 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:22,920 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash -983630985, now seen corresponding path program 1 times [2019-08-05 10:15:22,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:15:23,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:23,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:23,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:23,031 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 3 states. [2019-08-05 10:15:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,158 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-08-05 10:15:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:23,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-05 10:15:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,163 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:15:23,163 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:15:23,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:15:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:15:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:15:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2019-08-05 10:15:23,172 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 40 [2019-08-05 10:15:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,172 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2019-08-05 10:15:23,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2019-08-05 10:15:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:15:23,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,175 INFO L399 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] [2019-08-05 10:15:23,175 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2019-08-05 10:15:23,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:15:23,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:23,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:23,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:23,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:23,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:23,353 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 4 states. [2019-08-05 10:15:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,789 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-08-05 10:15:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:23,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-08-05 10:15:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,792 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:15:23,792 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:15:23,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:15:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2019-08-05 10:15:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:15:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2019-08-05 10:15:23,825 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 48 [2019-08-05 10:15:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,826 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2019-08-05 10:15:23,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2019-08-05 10:15:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:15:23,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,829 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:23,829 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1913328135, now seen corresponding path program 1 times [2019-08-05 10:15:23,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:15:23,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:23,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:23,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:23,984 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand 3 states. [2019-08-05 10:15:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,079 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-08-05 10:15:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:24,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-08-05 10:15:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,081 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:15:24,082 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:15:24,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:15:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:15:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:15:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2019-08-05 10:15:24,093 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 57 [2019-08-05 10:15:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,094 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2019-08-05 10:15:24,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2019-08-05 10:15:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:15:24,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,096 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:24,097 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1816080585, now seen corresponding path program 1 times [2019-08-05 10:15:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-08-05 10:15:24,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:24,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:24,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:24,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:24,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,201 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand 3 states. [2019-08-05 10:15:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,362 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2019-08-05 10:15:24,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:24,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:15:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,366 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:15:24,366 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:15:24,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:15:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:15:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:15:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2019-08-05 10:15:24,377 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 67 [2019-08-05 10:15:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,378 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2019-08-05 10:15:24,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2019-08-05 10:15:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:15:24,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,380 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:24,381 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1256666615, now seen corresponding path program 1 times [2019-08-05 10:15:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-08-05 10:15:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:24,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,460 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand 3 states. [2019-08-05 10:15:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,573 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2019-08-05 10:15:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:24,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-08-05 10:15:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,576 INFO L225 Difference]: With dead ends: 220 [2019-08-05 10:15:24,577 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 10:15:24,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 10:15:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-08-05 10:15:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:15:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2019-08-05 10:15:24,587 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 78 [2019-08-05 10:15:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,588 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2019-08-05 10:15:24,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2019-08-05 10:15:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:15:24,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,591 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:24,591 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1089410181, now seen corresponding path program 1 times [2019-08-05 10:15:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-05 10:15:24,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:24,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:24,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,676 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand 3 states. [2019-08-05 10:15:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,815 INFO L93 Difference]: Finished difference Result 259 states and 334 transitions. [2019-08-05 10:15:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:24,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-08-05 10:15:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,817 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:15:24,818 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 10:15:24,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 10:15:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-08-05 10:15:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:15:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 334 transitions. [2019-08-05 10:15:24,827 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 334 transitions. Word has length 90 [2019-08-05 10:15:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,827 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 334 transitions. [2019-08-05 10:15:24,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 334 transitions. [2019-08-05 10:15:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:15:24,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,830 INFO L399 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] [2019-08-05 10:15:24,830 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -755325398, now seen corresponding path program 1 times [2019-08-05 10:15:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:25,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-08-05 10:15:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:25,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:25,142 INFO L87 Difference]: Start difference. First operand 259 states and 334 transitions. Second operand 4 states. [2019-08-05 10:15:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,266 INFO L93 Difference]: Finished difference Result 412 states and 520 transitions. [2019-08-05 10:15:25,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:25,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-08-05 10:15:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,269 INFO L225 Difference]: With dead ends: 412 [2019-08-05 10:15:25,269 INFO L226 Difference]: Without dead ends: 412 [2019-08-05 10:15:25,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-08-05 10:15:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 349. [2019-08-05 10:15:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:15:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 451 transitions. [2019-08-05 10:15:25,278 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 451 transitions. Word has length 103 [2019-08-05 10:15:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 451 transitions. [2019-08-05 10:15:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 451 transitions. [2019-08-05 10:15:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:15:25,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,280 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:25,281 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -386874025, now seen corresponding path program 2 times [2019-08-05 10:15:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-08-05 10:15:25,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:25,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:25,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:25,350 INFO L87 Difference]: Start difference. First operand 349 states and 451 transitions. Second operand 3 states. [2019-08-05 10:15:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,475 INFO L93 Difference]: Finished difference Result 362 states and 432 transitions. [2019-08-05 10:15:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:25,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-08-05 10:15:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,483 INFO L225 Difference]: With dead ends: 362 [2019-08-05 10:15:25,483 INFO L226 Difference]: Without dead ends: 362 [2019-08-05 10:15:25,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-05 10:15:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2019-08-05 10:15:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:15:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2019-08-05 10:15:25,491 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 128 [2019-08-05 10:15:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,491 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2019-08-05 10:15:25,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2019-08-05 10:15:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:15:25,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,494 INFO L399 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] [2019-08-05 10:15:25,494 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1261907325, now seen corresponding path program 1 times [2019-08-05 10:15:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-05 10:15:25,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:25,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:25,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:25,697 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 4 states. [2019-08-05 10:15:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,307 INFO L93 Difference]: Finished difference Result 290 states and 342 transitions. [2019-08-05 10:15:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:26,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-08-05 10:15:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,308 INFO L225 Difference]: With dead ends: 290 [2019-08-05 10:15:26,308 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:15:26,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:15:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:15:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:15:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:15:26,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2019-08-05 10:15:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,309 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:15:26,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:15:26,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:15:26,314 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:26 BoogieIcfgContainer [2019-08-05 10:15:26,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:26,316 INFO L168 Benchmark]: Toolchain (without parser) took 6200.72 ms. Allocated memory was 137.4 MB in the beginning and 260.6 MB in the end (delta: 123.2 MB). Free memory was 105.9 MB in the beginning and 99.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 129.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,317 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 137.4 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.73 ms. Allocated memory is still 137.4 MB. Free memory was 105.9 MB in the beginning and 104.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,319 INFO L168 Benchmark]: Boogie Preprocessor took 53.53 ms. Allocated memory is still 137.4 MB. Free memory was 104.0 MB in the beginning and 102.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,320 INFO L168 Benchmark]: RCFGBuilder took 834.44 ms. Allocated memory is still 137.4 MB. Free memory was 102.5 MB in the beginning and 77.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,321 INFO L168 Benchmark]: TraceAbstraction took 5271.55 ms. Allocated memory was 137.4 MB in the beginning and 260.6 MB in the end (delta: 123.2 MB). Free memory was 76.8 MB in the beginning and 99.5 MB in the end (delta: -22.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:26,325 INFO L335 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.16 ms. Allocated memory is still 137.4 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.73 ms. Allocated memory is still 137.4 MB. Free memory was 105.9 MB in the beginning and 104.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.53 ms. Allocated memory is still 137.4 MB. Free memory was 104.0 MB in the beginning and 102.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.44 ms. Allocated memory is still 137.4 MB. Free memory was 102.5 MB in the beginning and 77.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5271.55 ms. Allocated memory was 137.4 MB in the beginning and 260.6 MB in the end (delta: 123.2 MB). Free memory was 76.8 MB in the beginning and 99.5 MB in the end (delta: -22.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 372 SDtfs, 55 SDslu, 125 SDs, 0 SdLazy, 482 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 876 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 138440 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5169 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3288/3385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...