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/concurrent/concurrentBoogie/showcase/ForkJoinExplained.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:05,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:05,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:05,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:05,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:05,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:05,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:05,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:05,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:05,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:05,508 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:05,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:05,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:05,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:05,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:05,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:05,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:05,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:05,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:05,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:05,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:05,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:05,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:05,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:05,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:05,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:05,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:05,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:05,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:05,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:05,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:05,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:05,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:05,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:05,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:05,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:05,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:05,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:05,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:05,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:05,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:05,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:05,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:05,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:05,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:05,591 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:05,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/ForkJoinExplained.bpl [2019-08-05 09:52:05,592 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/ForkJoinExplained.bpl' [2019-08-05 09:52:05,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:05,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:05,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:05,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:05,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:05,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:05,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:05,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:05,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:05,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (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 09:52:05,757 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 09:52:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 09:52:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 09:52:05,758 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 09:52:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:52:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:52:05,759 WARN L201 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-08-05 09:52:06,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:52:06,142 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 09:52:06,143 INFO L202 PluginConnector]: Adding new model ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06 BoogieIcfgContainer [2019-08-05 09:52:06,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:06,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:06,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:06,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:06,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/2) ... [2019-08-05 09:52:06,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497ae17 and model type ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:06, skipping insertion in model container [2019-08-05 09:52:06,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06" (2/2) ... [2019-08-05 09:52:06,152 INFO L109 eAbstractionObserver]: Analyzing ICFG ForkJoinExplained.bpl [2019-08-05 09:52:06,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_foo_n not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_foo_n not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,183 WARN L317 ript$VariableManager]: TermVariabe Thread1_foo_res not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,183 WARN L317 ript$VariableManager]: TermVariabe Thread1_foo_res not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,184 WARN L317 ript$VariableManager]: TermVariabe Thread0_foo_n not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,184 WARN L317 ript$VariableManager]: TermVariabe Thread0_foo_n not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,185 WARN L317 ript$VariableManager]: TermVariabe Thread0_foo_res not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,185 WARN L317 ript$VariableManager]: TermVariabe Thread0_foo_res not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:06,262 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 09:52:06,275 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 09:52:06,298 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:06,299 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:06,299 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:06,299 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:06,299 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:06,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:06,299 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:06,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:06,300 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:06,310 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28places, 29 transitions [2019-08-05 09:52:06,332 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 133 states. [2019-08-05 09:52:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2019-08-05 09:52:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:06,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,348 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1973510269, now seen corresponding path program 1 times [2019-08-05 09:52:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,585 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 09:52:06,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:06,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:06,618 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2019-08-05 09:52:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:06,782 INFO L93 Difference]: Finished difference Result 187 states and 356 transitions. [2019-08-05 09:52:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:06,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 09:52:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:06,800 INFO L225 Difference]: With dead ends: 187 [2019-08-05 09:52:06,800 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 09:52:06,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 09:52:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2019-08-05 09:52:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 09:52:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 305 transitions. [2019-08-05 09:52:06,860 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 305 transitions. Word has length 10 [2019-08-05 09:52:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:06,860 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 305 transitions. [2019-08-05 09:52:06,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 305 transitions. [2019-08-05 09:52:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:06,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,864 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1056453916, now seen corresponding path program 1 times [2019-08-05 09:52:06,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,889 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 09:52:06,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:06,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,892 INFO L87 Difference]: Start difference. First operand 154 states and 305 transitions. Second operand 3 states. [2019-08-05 09:52:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:06,910 INFO L93 Difference]: Finished difference Result 98 states and 179 transitions. [2019-08-05 09:52:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:06,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 09:52:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:06,912 INFO L225 Difference]: With dead ends: 98 [2019-08-05 09:52:06,912 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 09:52:06,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 09:52:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 09:52:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 09:52:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 179 transitions. [2019-08-05 09:52:06,925 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 179 transitions. Word has length 10 [2019-08-05 09:52:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:06,925 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 179 transitions. [2019-08-05 09:52:06,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 179 transitions. [2019-08-05 09:52:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:06,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,927 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 565301036, now seen corresponding path program 1 times [2019-08-05 09:52:06,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,959 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 09:52:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:06,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,961 INFO L87 Difference]: Start difference. First operand 98 states and 179 transitions. Second operand 3 states. [2019-08-05 09:52:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:06,968 INFO L93 Difference]: Finished difference Result 80 states and 136 transitions. [2019-08-05 09:52:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:06,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 09:52:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:06,970 INFO L225 Difference]: With dead ends: 80 [2019-08-05 09:52:06,970 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 09:52:06,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 09:52:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 09:52:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 09:52:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-08-05 09:52:06,978 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 10 [2019-08-05 09:52:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:06,978 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-08-05 09:52:06,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-08-05 09:52:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:06,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,980 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 594883499, now seen corresponding path program 1 times [2019-08-05 09:52:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,045 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 09:52:07,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,047 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-08-05 09:52:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,061 INFO L93 Difference]: Finished difference Result 53 states and 88 transitions. [2019-08-05 09:52:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 09:52:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,065 INFO L225 Difference]: With dead ends: 53 [2019-08-05 09:52:07,065 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 09:52:07,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 09:52:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 09:52:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 09:52:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2019-08-05 09:52:07,072 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 79 transitions. Word has length 10 [2019-08-05 09:52:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,072 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 79 transitions. [2019-08-05 09:52:07,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2019-08-05 09:52:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 09:52:07,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,074 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1049276137, now seen corresponding path program 1 times [2019-08-05 09:52:07,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,136 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 09:52:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:07,138 INFO L87 Difference]: Start difference. First operand 48 states and 79 transitions. Second operand 4 states. [2019-08-05 09:52:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,200 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2019-08-05 09:52:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:07,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 09:52:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,201 INFO L225 Difference]: With dead ends: 46 [2019-08-05 09:52:07,202 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 09:52:07,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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 09:52:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 09:52:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 09:52:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 09:52:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2019-08-05 09:52:07,213 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 11 [2019-08-05 09:52:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,214 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2019-08-05 09:52:07,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2019-08-05 09:52:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:52:07,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,215 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 949084505, now seen corresponding path program 1 times [2019-08-05 09:52:07,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,297 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 09:52:07,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:07,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:07,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:07,299 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 5 states. [2019-08-05 09:52:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,386 INFO L93 Difference]: Finished difference Result 61 states and 97 transitions. [2019-08-05 09:52:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:07,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 09:52:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,387 INFO L225 Difference]: With dead ends: 61 [2019-08-05 09:52:07,387 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 09:52:07,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 09:52:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 09:52:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 09:52:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 09:52:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 09:52:07,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 13 [2019-08-05 09:52:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,391 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 09:52:07,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 09:52:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:52:07,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,393 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2001689471, now seen corresponding path program 2 times [2019-08-05 09:52:07,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,485 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 09:52:07,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:07,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:07,487 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 5 states. [2019-08-05 09:52:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,563 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2019-08-05 09:52:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:07,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 09:52:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,564 INFO L225 Difference]: With dead ends: 30 [2019-08-05 09:52:07,565 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 09:52:07,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 09:52:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 09:52:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 09:52:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 09:52:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 09:52:07,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-08-05 09:52:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,567 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 09:52:07,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 09:52:07,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 09:52:07,571 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-08-05 09:52:07,573 INFO L202 PluginConnector]: Adding new model ForkJoinExplained.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:07 BasicIcfg [2019-08-05 09:52:07,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:07,576 INFO L168 Benchmark]: Toolchain (without parser) took 1946.95 ms. Allocated memory was 131.6 MB in the beginning and 173.5 MB in the end (delta: 41.9 MB). Free memory was 109.1 MB in the beginning and 127.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:07,577 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 131.6 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 09:52:07,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 131.6 MB. Free memory was 109.1 MB in the beginning and 107.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 09:52:07,579 INFO L168 Benchmark]: Boogie Preprocessor took 20.37 ms. Allocated memory is still 131.6 MB. Free memory was 107.3 MB in the beginning and 106.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:07,583 INFO L168 Benchmark]: RCFGBuilder took 457.87 ms. Allocated memory is still 131.6 MB. Free memory was 106.2 MB in the beginning and 95.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:07,584 INFO L168 Benchmark]: TraceAbstraction took 1428.60 ms. Allocated memory was 131.6 MB in the beginning and 173.5 MB in the end (delta: 41.9 MB). Free memory was 95.5 MB in the beginning and 127.0 MB in the end (delta: -31.5 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:07,594 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.27 ms. Allocated memory is still 131.6 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 131.6 MB. Free memory was 109.1 MB in the beginning and 107.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 20.37 ms. Allocated memory is still 131.6 MB. Free memory was 107.3 MB in the beginning and 106.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 457.87 ms. Allocated memory is still 131.6 MB. Free memory was 106.2 MB in the beginning and 95.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1428.60 ms. Allocated memory was 131.6 MB in the beginning and 173.5 MB in the end (delta: 41.9 MB). Free memory was 95.5 MB in the beginning and 127.0 MB in the end (delta: -31.5 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 61]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 55]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 3 error locations. SAFE Result, 1.2s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 167 SDtfs, 112 SDslu, 170 SDs, 0 SdLazy, 48 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=1, 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, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1618 SizeOfPredicates, 3 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...