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_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:22:12,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:22:12,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:22:12,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:22:12,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:22:12,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:22:12,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:22:12,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:22:12,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:22:12,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:22:12,094 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:22:12,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:22:12,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:22:12,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:22:12,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:22:12,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:22:12,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:22:12,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:22:12,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:22:12,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:22:12,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:22:12,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:22:12,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:22:12,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:22:12,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:22:12,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:22:12,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:22:12,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:22:12,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:22:12,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:22:12,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:22:12,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:22:12,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:22:12,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:22:12,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:22:12,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:22:12,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:22:12,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:22:12,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:22:12,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:22:12,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:22:12,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:22:12,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:22:12,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:22:12,189 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:22:12,190 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:22:12,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2019-08-05 10:22:12,191 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2019-08-05 10:22:12,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:22:12,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:22:12,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:12,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:22:12,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:22:12,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:12,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:22:12,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:22:12,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:22:12,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/1) ... [2019-08-05 10:22:12,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:22:12,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:22:12,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:22:12,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:22:12,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (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:22:12,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:22:12,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:22:13,000 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:22:13,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:22:13,097 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:22:13,098 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:13 BoogieIcfgContainer [2019-08-05 10:22:13,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:22:13,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:22:13,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:22:13,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:22:13,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:12" (1/2) ... [2019-08-05 10:22:13,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b1f2ce and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:22:13, skipping insertion in model container [2019-08-05 10:22:13,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:13" (2/2) ... [2019-08-05 10:22:13,106 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2019-08-05 10:22:13,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:22:13,124 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:22:13,140 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:22:13,166 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:22:13,167 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:22:13,167 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:22:13,167 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:22:13,168 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:22:13,168 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:22:13,168 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:22:13,168 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:22:13,168 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:22:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 10:22:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:22:13,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:13,193 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2019-08-05 10:22:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:13,363 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:22:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:22:13,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:13,385 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 10:22:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:13,475 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:22:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:13,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 10:22:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:13,491 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:22:13,492 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:22:13,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:22:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:22:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:22:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:22:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:22:13,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 7 [2019-08-05 10:22:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:13,546 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:22:13,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:22:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:22:13,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,549 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:13,550 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2019-08-05 10:22:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:13,695 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:22:13,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:13,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:13,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:13,705 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2019-08-05 10:22:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:13,909 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-08-05 10:22:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:13,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:22:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:13,910 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:22:13,911 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:22:13,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:22:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:22:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:22:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:22:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 10:22:13,916 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 10 [2019-08-05 10:22:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:13,916 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 10:22:13,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 10:22:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:22:13,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,917 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:13,918 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2019-08-05 10:22:13,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,040 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:22:14,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:14,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:14,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:14,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:14,043 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 3 states. [2019-08-05 10:22:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,121 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-08-05 10:22:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:14,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:22:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,123 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:22:14,123 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:22:14,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:22:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:22:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-08-05 10:22:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:22:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-08-05 10:22:14,129 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-08-05 10:22:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,130 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-08-05 10:22:14,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-08-05 10:22:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:22:14,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,131 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:14,131 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash 471489091, now seen corresponding path program 1 times [2019-08-05 10:22:14,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:22:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:14,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:14,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:14,266 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2019-08-05 10:22:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,519 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-08-05 10:22:14,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:22:14,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 10:22:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,523 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:22:14,523 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:22:14,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:22:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:22:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:22:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-08-05 10:22:14,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 21 [2019-08-05 10:22:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,533 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-08-05 10:22:14,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-08-05 10:22:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:22:14,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,535 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:14,535 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 275899509, now seen corresponding path program 1 times [2019-08-05 10:22:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:22:14,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:14,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:14,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:14,636 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 3 states. [2019-08-05 10:22:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,747 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-08-05 10:22:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:14,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-05 10:22:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,749 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:22:14,750 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:22:14,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:22:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:22:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:22:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:22:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-08-05 10:22:14,757 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 26 [2019-08-05 10:22:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,758 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-08-05 10:22:14,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-08-05 10:22:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:22:14,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,759 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:22:14,760 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2048264231, now seen corresponding path program 2 times [2019-08-05 10:22:14,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 10:22:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:22:14,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:14,964 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 4 states. [2019-08-05 10:22:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:15,084 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-08-05 10:22:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:22:15,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:22:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:15,087 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:22:15,088 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:22:15,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:22:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-08-05 10:22:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:22:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2019-08-05 10:22:15,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 28 [2019-08-05 10:22:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:15,096 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2019-08-05 10:22:15,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2019-08-05 10:22:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:22:15,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:15,097 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:15,098 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1703845991, now seen corresponding path program 2 times [2019-08-05 10:22:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:15,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:22:15,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:22:15,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:15,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:22:15,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:22:15,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:22:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:15,363 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 6 states. [2019-08-05 10:22:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:15,821 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-08-05 10:22:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:22:15,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-08-05 10:22:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:15,824 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:22:15,824 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:22:15,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:22:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-08-05 10:22:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:22:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-08-05 10:22:15,831 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 33 [2019-08-05 10:22:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:15,832 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-08-05 10:22:15,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:22:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-08-05 10:22:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:22:15,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:15,834 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:22:15,834 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2134298763, now seen corresponding path program 3 times [2019-08-05 10:22:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:15,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:22:15,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:16,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:16,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:22:16,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:16,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:22:16,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:22:16,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:22:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:22:16,297 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 8 states. [2019-08-05 10:22:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:16,664 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2019-08-05 10:22:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:22:16,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-08-05 10:22:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:16,665 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:22:16,666 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:22:16,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:22:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:22:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-08-05 10:22:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:22:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-08-05 10:22:16,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 45 [2019-08-05 10:22:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:16,674 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-08-05 10:22:16,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:22:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-08-05 10:22:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:22:16,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:16,676 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2019-08-05 10:22:16,676 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:16,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1173574567, now seen corresponding path program 4 times [2019-08-05 10:22:16,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:16,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:22:16,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:17,017 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-08-05 10:22:17,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 10:22:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:17,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:17,055 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-08-05 10:22:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:17,327 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-08-05 10:22:17,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:22:17,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-08-05 10:22:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:17,328 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:22:17,328 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:22:17,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:22:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:22:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:22:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:22:17,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-08-05 10:22:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:17,330 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:22:17,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:22:17,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:22:17,336 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:22:17 BoogieIcfgContainer [2019-08-05 10:22:17,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:22:17,338 INFO L168 Benchmark]: Toolchain (without parser) took 5080.43 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 108.3 MB in the beginning and 84.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:17,339 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 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:22:17,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.16 ms. Allocated memory is still 131.6 MB. Free memory was 108.1 MB in the beginning and 106.4 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:22:17,341 INFO L168 Benchmark]: Boogie Preprocessor took 57.76 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 105.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:17,342 INFO L168 Benchmark]: RCFGBuilder took 739.32 ms. Allocated memory is still 131.6 MB. Free memory was 104.8 MB in the beginning and 79.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:17,343 INFO L168 Benchmark]: TraceAbstraction took 4236.45 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 79.4 MB in the beginning and 84.5 MB in the end (delta: -5.1 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:17,347 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.20 ms. Allocated memory is still 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 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 42.16 ms. Allocated memory is still 131.6 MB. Free memory was 108.1 MB in the beginning and 106.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.76 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 105.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 739.32 ms. Allocated memory is still 131.6 MB. Free memory was 104.8 MB in the beginning and 79.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4236.45 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 79.4 MB in the beginning and 84.5 MB in the end (delta: -5.1 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: 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, 11 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 22 SDslu, 100 SDs, 0 SdLazy, 452 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 52892 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2223 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 323/452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...