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_4.cil.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:17:24,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:17:24,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:17:24,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:17:24,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:17:24,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:17:24,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:17:24,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:17:24,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:17:24,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:17:24,734 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:17:24,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:17:24,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:17:24,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:17:24,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:17:24,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:17:24,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:17:24,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:17:24,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:17:24,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:17:24,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:17:24,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:17:24,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:17:24,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:17:24,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:17:24,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:17:24,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:17:24,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:17:24,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:17:24,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:17:24,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:17:24,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:17:24,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:17:24,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:17:24,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:17:24,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:17:24,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:17:24,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:17:24,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:17:24,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:17:24,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:17:24,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:17:24,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:17:24,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:17:24,819 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:17:24,820 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:17:24,821 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl [2019-08-05 10:17:24,821 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl' [2019-08-05 10:17:24,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:17:24,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:17:24,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:24,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:17:24,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:17:24,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:24,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:17:24,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:17:24,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:17:24,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:24,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/1) ... [2019-08-05 10:17:25,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:17:25,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:17:25,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:17:25,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:17:25,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (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:17:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:17:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:17:25,655 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:17:25,655 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:17:25,656 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:25 BoogieIcfgContainer [2019-08-05 10:17:25,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:17:25,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:17:25,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:17:25,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:17:25,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:24" (1/2) ... [2019-08-05 10:17:25,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d58112 and model type s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:17:25, skipping insertion in model container [2019-08-05 10:17:25,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:25" (2/2) ... [2019-08-05 10:17:25,665 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c_14.bpl [2019-08-05 10:17:25,675 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:17:25,682 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:17:25,696 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:17:25,723 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:17:25,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:17:25,724 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:17:25,724 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:17:25,724 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:17:25,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:17:25,725 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:17:25,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:17:25,725 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:17:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 10:17:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:17:25,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:25,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:25,749 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 212045975, now seen corresponding path program 1 times [2019-08-05 10:17:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:25,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:17:25,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:25,940 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:17:25,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:25,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:17:25,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:25,964 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 10:17:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,032 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 10:17:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:26,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:17:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,053 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:17:26,053 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:17:26,055 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:17:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:17:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:17:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:17:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 10:17:26,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 8 [2019-08-05 10:17:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:26,086 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 10:17:26,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 10:17:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:17:26,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:26,088 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:26,088 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash -251001873, now seen corresponding path program 1 times [2019-08-05 10:17:26,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:26,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,200 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:17:26,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:26,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:26,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:26,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:26,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:26,203 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 3 states. [2019-08-05 10:17:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,339 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-05 10:17:26,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:26,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:17:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,341 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:17:26,341 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:17:26,342 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:17:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:17:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:17:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:17:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-08-05 10:17:26,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2019-08-05 10:17:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-08-05 10:17:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-08-05 10:17:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:17:26,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:26,348 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:26,348 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -129109843, now seen corresponding path program 1 times [2019-08-05 10:17:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:26,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:17:26,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,437 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:17:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:26,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:26,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:26,439 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2019-08-05 10:17:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,558 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-08-05 10:17:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:26,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:17:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,561 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:17:26,561 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:17:26,561 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:17:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:17:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:17:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:17:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-08-05 10:17:26,566 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 15 [2019-08-05 10:17:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:26,567 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-08-05 10:17:26,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-08-05 10:17:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:17:26,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:26,568 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:26,569 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1092777889, now seen corresponding path program 1 times [2019-08-05 10:17:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:26,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:17:26,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,647 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:17:26,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:26,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:26,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:26,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:26,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:26,649 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 3 states. [2019-08-05 10:17:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,744 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-08-05 10:17:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:26,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:17:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,746 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:17:26,746 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:17:26,746 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:17:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:17:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-08-05 10:17:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:17:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-08-05 10:17:26,752 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 20 [2019-08-05 10:17:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:26,753 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-08-05 10:17:26,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-08-05 10:17:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:17:26,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:26,754 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:26,754 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 599625481, now seen corresponding path program 1 times [2019-08-05 10:17:26,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:26,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:26,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:26,898 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:17:26,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:26,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:17:26,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:26,900 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-08-05 10:17:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:27,006 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-08-05 10:17:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:17:27,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 10:17:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:27,013 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:17:27,013 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:17:27,014 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:17:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:17:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 10:17:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:17:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2019-08-05 10:17:27,028 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 21 [2019-08-05 10:17:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,029 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-08-05 10:17:27,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2019-08-05 10:17:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:17:27,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:27,031 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:27,032 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -616826779, now seen corresponding path program 2 times [2019-08-05 10:17:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:27,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:17:27,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:17:27,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:27,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:27,163 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 3 states. [2019-08-05 10:17:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:27,286 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2019-08-05 10:17:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:27,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:17:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:27,288 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:17:27,288 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:17:27,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:17:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:17:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:17:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-08-05 10:17:27,295 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 27 [2019-08-05 10:17:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,295 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-08-05 10:17:27,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-08-05 10:17:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:17:27,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:27,297 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:27,297 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 63414829, now seen corresponding path program 1 times [2019-08-05 10:17:27,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:27,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:27,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 10:17:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:27,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:27,371 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 3 states. [2019-08-05 10:17:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:27,471 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2019-08-05 10:17:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:27,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-08-05 10:17:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:27,472 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:17:27,472 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:17:27,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:17:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:17:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-08-05 10:17:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:17:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-08-05 10:17:27,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 34 [2019-08-05 10:17:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,479 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-08-05 10:17:27,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-08-05 10:17:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:17:27,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:27,481 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:27,481 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1473076375, now seen corresponding path program 1 times [2019-08-05 10:17:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:27,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:27,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 64 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 10:17:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:27,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:17:27,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:27,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:27,567 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2019-08-05 10:17:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:27,973 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-08-05 10:17:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:17:27,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-08-05 10:17:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:27,974 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:17:27,974 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:17:27,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:17:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:17:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:17:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:17:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:17:27,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-08-05 10:17:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,976 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:17:27,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:17:27,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:17:27,980 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:17:27 BoogieIcfgContainer [2019-08-05 10:17:27,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:17:27,984 INFO L168 Benchmark]: Toolchain (without parser) took 3085.14 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 109.6 MB in the beginning and 63.1 MB in the end (delta: 46.6 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:27,985 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:17:27,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.63 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.5 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:17:27,992 INFO L168 Benchmark]: Boogie Preprocessor took 54.45 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:27,993 INFO L168 Benchmark]: RCFGBuilder took 654.56 ms. Allocated memory is still 134.2 MB. Free memory was 106.3 MB in the beginning and 84.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:27,997 INFO L168 Benchmark]: TraceAbstraction took 2322.73 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 84.1 MB in the beginning and 64.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:28,005 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.22 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.63 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.5 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.45 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 654.56 ms. Allocated memory is still 134.2 MB. Free memory was 106.3 MB in the beginning and 84.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2322.73 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 84.1 MB in the beginning and 64.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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.2s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 17 SDslu, 41 SDs, 0 SdLazy, 129 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, 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, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 6835 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1939 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 228/239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...