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.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:24:55,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:24:55,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:24:55,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:24:55,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:24:55,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:24:55,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:24:55,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:24:55,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:24:55,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:24:55,072 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:24:55,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:24:55,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:24:55,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:24:55,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:24:55,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:24:55,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:24:55,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:24:55,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:24:55,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:24:55,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:24:55,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:24:55,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:24:55,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:24:55,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:24:55,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:24:55,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:24:55,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:24:55,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:24:55,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:24:55,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:24:55,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:24:55,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:24:55,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:24:55,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:24:55,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:24:55,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:24:55,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:24:55,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:24:55,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:24:55,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:24:55,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:24:55,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:24:55,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:24:55,184 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:24:55,185 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:24:55,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl [2019-08-05 10:24:55,187 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl' [2019-08-05 10:24:55,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:24:55,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:24:55,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:55,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:24:55,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:24:55,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:55,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:24:55,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:24:55,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:24:55,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/1) ... [2019-08-05 10:24:55,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:24:55,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:24:55,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:24:55,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:24:55,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (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:24:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:24:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:24:56,148 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:24:56,148 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:24:56,149 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:56 BoogieIcfgContainer [2019-08-05 10:24:56,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:24:56,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:24:56,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:24:56,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:24:56,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:55" (1/2) ... [2019-08-05 10:24:56,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d112fbe and model type s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:24:56, skipping insertion in model container [2019-08-05 10:24:56,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:56" (2/2) ... [2019-08-05 10:24:56,158 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil.c_16.bpl [2019-08-05 10:24:56,167 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:24:56,176 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:24:56,193 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:24:56,219 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:24:56,220 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:24:56,221 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:24:56,221 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:24:56,221 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:24:56,221 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:24:56,221 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:24:56,222 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:24:56,222 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:24:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 10:24:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:24:56,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:56,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:56,246 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash 212232665, now seen corresponding path program 1 times [2019-08-05 10:24:56,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:56,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:56,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:56,426 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:24:56,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:56,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:24:56,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:56,452 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 10:24:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:56,532 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2019-08-05 10:24:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:56,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:24:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:56,546 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:24:56,546 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:24:56,548 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:24:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:24:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:24:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:24:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-08-05 10:24:56,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 8 [2019-08-05 10:24:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:56,597 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-08-05 10:24:56,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2019-08-05 10:24:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:24:56,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:56,599 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:56,599 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash -250815183, now seen corresponding path program 1 times [2019-08-05 10:24:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:56,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:56,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:56,710 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:24:56,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:56,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:56,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:56,714 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. [2019-08-05 10:24:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:56,844 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-08-05 10:24:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:56,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:24:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:56,846 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:24:56,846 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:24:56,847 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:24:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:24:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:24:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:24:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-08-05 10:24:56,851 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 11 [2019-08-05 10:24:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:56,852 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-08-05 10:24:56,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-08-05 10:24:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:24:56,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:56,853 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:56,853 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1947459099, now seen corresponding path program 1 times [2019-08-05 10:24:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:56,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:56,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:56,916 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:24:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:56,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:56,919 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 3 states. [2019-08-05 10:24:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:56,999 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-08-05 10:24:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:57,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:24:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,001 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:24:57,001 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:24:57,002 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:24:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:24:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:24:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:24:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-08-05 10:24:57,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 15 [2019-08-05 10:24:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,008 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-08-05 10:24:57,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2019-08-05 10:24:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:24:57,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,009 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:57,009 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 177840891, now seen corresponding path program 1 times [2019-08-05 10:24:57,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:24:57,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:57,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:57,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:57,074 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 3 states. [2019-08-05 10:24:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:57,171 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2019-08-05 10:24:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:57,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:24:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,173 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:24:57,173 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:24:57,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:24:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:24:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-08-05 10:24:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:24:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-08-05 10:24:57,182 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 20 [2019-08-05 10:24:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,182 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-08-05 10:24:57,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-08-05 10:24:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:24:57,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,184 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:57,187 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1373628612, now seen corresponding path program 1 times [2019-08-05 10:24:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:57,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:57,312 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:24:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:24:57,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:24:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:24:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:24:57,315 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2019-08-05 10:24:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:57,453 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-08-05 10:24:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:24:57,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:24:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,465 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:24:57,465 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:24:57,466 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:24:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:24:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:24:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:24:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-08-05 10:24:57,475 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 21 [2019-08-05 10:24:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,475 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-08-05 10:24:57,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:24:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-08-05 10:24:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:24:57,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,477 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:24:57,477 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1217592621, now seen corresponding path program 1 times [2019-08-05 10:24:57,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:57,583 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:24:57,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:57,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:57,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:57,585 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-08-05 10:24:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:57,720 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-08-05 10:24:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:57,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-08-05 10:24:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,725 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:24:57,725 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:24:57,726 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:24:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:24:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:24:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:24:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 10:24:57,735 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 38 [2019-08-05 10:24:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 10:24:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 10:24:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:24:57,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,737 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:57,737 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1341887865, now seen corresponding path program 1 times [2019-08-05 10:24:57,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:57,923 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:24:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:24:57,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:24:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:24:57,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:57,927 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 4 states. [2019-08-05 10:24:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:58,330 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-08-05 10:24:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:24:58,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-08-05 10:24:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:58,333 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:24:58,334 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:24:58,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:24:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:24:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:24:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:24:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:24:58,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-08-05 10:24:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:58,336 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:24:58,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:24:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:24:58,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:24:58,344 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:24:58 BoogieIcfgContainer [2019-08-05 10:24:58,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:24:58,348 INFO L168 Benchmark]: Toolchain (without parser) took 3082.75 ms. Allocated memory was 139.5 MB in the beginning and 178.3 MB in the end (delta: 38.8 MB). Free memory was 108.2 MB in the beginning and 70.7 MB in the end (delta: 37.5 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:58,350 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.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:24:58,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.72 ms. Allocated memory is still 139.5 MB. Free memory was 108.0 MB in the beginning and 106.3 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:24:58,352 INFO L168 Benchmark]: Boogie Preprocessor took 54.77 ms. Allocated memory is still 139.5 MB. Free memory was 106.3 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:24:58,353 INFO L168 Benchmark]: RCFGBuilder took 790.10 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 81.4 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:58,354 INFO L168 Benchmark]: TraceAbstraction took 2193.65 ms. Allocated memory was 139.5 MB in the beginning and 178.3 MB in the end (delta: 38.8 MB). Free memory was 80.9 MB in the beginning and 70.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:58,363 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.29 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.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 39.72 ms. Allocated memory is still 139.5 MB. Free memory was 108.0 MB in the beginning and 106.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.77 ms. Allocated memory is still 139.5 MB. Free memory was 106.3 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 790.10 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 81.4 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2193.65 ms. Allocated memory was 139.5 MB in the beginning and 178.3 MB in the end (delta: 38.8 MB). Free memory was 80.9 MB in the beginning and 70.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 399]: 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, 2.1s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 20 SDslu, 71 SDs, 0 SdLazy, 129 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 6493 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1691 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 231/249 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...