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_2.BV.c.cil.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:25:32,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:25:32,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:25:32,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:25:32,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:25:32,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:25:32,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:25:32,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:25:32,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:25:32,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:25:32,887 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:25:32,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:25:32,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:25:32,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:25:32,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:25:32,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:25:32,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:25:32,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:25:32,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:25:32,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:25:32,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:25:32,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:25:32,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:25:32,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:25:32,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:25:32,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:25:32,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:25:32,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:25:32,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:25:32,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:25:32,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:25:32,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:25:32,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:25:32,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:25:32,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:25:32,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:25:32,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:25:32,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:25:32,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:25:32,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:25:32,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:25:32,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:25:32,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:25:33,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:25:33,002 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:25:33,002 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:25:33,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl [2019-08-05 10:25:33,003 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl' [2019-08-05 10:25:33,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:25:33,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:25:33,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:33,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:25:33,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:25:33,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:33,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:25:33,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:25:33,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:25:33,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/1) ... [2019-08-05 10:25:33,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:25:33,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:25:33,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:25:33,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:25:33,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (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:25:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:25:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:25:33,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:25:33,904 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:25:33,905 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:33 BoogieIcfgContainer [2019-08-05 10:25:33,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:25:33,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:25:33,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:25:33,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:25:33,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:33" (1/2) ... [2019-08-05 10:25:33,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aede00 and model type s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:25:33, skipping insertion in model container [2019-08-05 10:25:33,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:33" (2/2) ... [2019-08-05 10:25:33,914 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.BV.c.cil.c_13.bpl [2019-08-05 10:25:33,924 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:25:33,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:25:33,950 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:25:33,977 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:25:33,978 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:25:33,978 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:25:33,978 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:25:33,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:25:33,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:25:33,979 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:25:33,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:25:33,979 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:25:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 10:25:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:25:34,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:34,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:34,005 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash 212232727, now seen corresponding path program 1 times [2019-08-05 10:25:34,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:34,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:25:34,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:34,187 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:25:34,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:34,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:25:34,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:34,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:34,214 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 10:25:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:34,293 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2019-08-05 10:25:34,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:34,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:25:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:34,307 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:25:34,308 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:25:34,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:25:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:25:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:25:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:25:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-08-05 10:25:34,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 8 [2019-08-05 10:25:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:34,369 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-08-05 10:25:34,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2019-08-05 10:25:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:25:34,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:34,370 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:34,372 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash -250815121, now seen corresponding path program 1 times [2019-08-05 10:25:34,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:34,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:25:34,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:34,493 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:25:34,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:34,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:34,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:34,496 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. [2019-08-05 10:25:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:34,585 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-08-05 10:25:34,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:34,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:25:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:34,586 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:25:34,587 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:25:34,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:25:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:25:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:25:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:25:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:25:34,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 11 [2019-08-05 10:25:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:34,595 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:25:34,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:25:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:25:34,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:34,596 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:34,596 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 820063068, now seen corresponding path program 1 times [2019-08-05 10:25:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:34,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:25:34,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:34,685 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:25:34,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:34,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:34,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:34,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:34,687 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2019-08-05 10:25:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:34,797 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-08-05 10:25:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:34,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:25:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:34,804 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:25:34,804 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:25:34,804 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:25:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:25:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:25:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:25:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2019-08-05 10:25:34,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 15 [2019-08-05 10:25:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:34,815 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-08-05 10:25:34,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2019-08-05 10:25:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:25:34,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:34,817 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:34,817 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash -18544326, now seen corresponding path program 1 times [2019-08-05 10:25:34,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:34,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:25:34,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:34,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:34,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:25:34,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:25:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:25:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:34,986 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 5 states. [2019-08-05 10:25:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,105 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:25:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:35,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:25:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,109 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:25:35,109 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:25:35,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:25:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:25:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:25:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2019-08-05 10:25:35,117 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 21 [2019-08-05 10:25:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,118 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2019-08-05 10:25:35,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:25:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2019-08-05 10:25:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:25:35,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:35,119 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:25:35,120 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 438121285, now seen corresponding path program 2 times [2019-08-05 10:25:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:35,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:25:35,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 10:25:35,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:35,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:35,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:35,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:35,187 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand 3 states. [2019-08-05 10:25:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,299 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2019-08-05 10:25:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:35,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-08-05 10:25:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,303 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:25:35,303 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:25:35,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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:25:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:25:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:25:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:25:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-08-05 10:25:35,312 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 31 [2019-08-05 10:25:35,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,312 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-08-05 10:25:35,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2019-08-05 10:25:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:25:35,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:35,314 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:25:35,314 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1968241, now seen corresponding path program 1 times [2019-08-05 10:25:35,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:35,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:25:35,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 10:25:35,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:35,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:35,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:35,395 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 3 states. [2019-08-05 10:25:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,523 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-08-05 10:25:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:35,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-08-05 10:25:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,526 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:25:35,526 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:25:35,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:25:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:25:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:25:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:25:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2019-08-05 10:25:35,535 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 38 [2019-08-05 10:25:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,535 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2019-08-05 10:25:35,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2019-08-05 10:25:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:25:35,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:35,537 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:35,538 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1527084167, now seen corresponding path program 1 times [2019-08-05 10:25:35,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:35,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:25:35,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 10:25:35,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:35,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:25:35,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:25:35,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:25:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:35,659 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 4 states. [2019-08-05 10:25:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,899 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-08-05 10:25:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:35,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-08-05 10:25:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,902 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:25:35,902 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:25:35,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:25:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:25:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:25:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:25:35,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-08-05 10:25:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,905 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:25:35,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:25:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:25:35,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:25:35,910 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:35 BoogieIcfgContainer [2019-08-05 10:25:35,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:35,913 INFO L168 Benchmark]: Toolchain (without parser) took 2842.89 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 109.2 MB in the beginning and 69.2 MB in the end (delta: 40.0 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:35,914 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 111.3 MB in the beginning and 111.1 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:25:35,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.64 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:35,916 INFO L168 Benchmark]: Boogie Preprocessor took 55.89 ms. Allocated memory is still 141.6 MB. Free memory was 107.4 MB in the beginning and 105.9 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:25:35,917 INFO L168 Benchmark]: RCFGBuilder took 732.01 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 82.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:35,918 INFO L168 Benchmark]: TraceAbstraction took 2002.84 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 82.4 MB in the beginning and 69.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:35,922 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.23 ms. Allocated memory is still 141.6 MB. Free memory was 111.3 MB in the beginning and 111.1 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 47.64 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.89 ms. Allocated memory is still 141.6 MB. Free memory was 107.4 MB in the beginning and 105.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 732.01 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 82.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2002.84 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 82.4 MB in the beginning and 69.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 379]: 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, 1.9s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 23 SDslu, 95 SDs, 0 SdLazy, 131 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=6, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 7142 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1763 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 268/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...