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/NonAtomicIncrement_2Threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:08,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:08,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:08,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:08,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:08,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:08,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:08,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:08,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:08,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:08,494 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:08,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:08,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:08,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:08,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:08,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:08,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:08,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:08,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:08,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:08,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:08,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:08,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:08,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:08,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:08,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:08,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:08,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:08,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:08,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:08,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:08,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:08,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:08,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:08,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:08,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:08,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:08,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:08,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:08,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:08,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:08,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:08,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:08,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:08,614 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:08,614 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:08,615 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/NonAtomicIncrement_2Threads.bpl [2019-08-05 09:52:08,616 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/NonAtomicIncrement_2Threads.bpl' [2019-08-05 09:52:08,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:08,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:08,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:08,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:08,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:08,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:08,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:08,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:08,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:08,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/1) ... [2019-08-05 09:52:08,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:08,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:08,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:08,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:08,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (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:08,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 09:52:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:52:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:52:08,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess1 given in one single declaration [2019-08-05 09:52:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess1 [2019-08-05 09:52:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess1 [2019-08-05 09:52:08,783 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess2 given in one single declaration [2019-08-05 09:52:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess2 [2019-08-05 09:52:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess2 [2019-08-05 09:52:08,785 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:09,124 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:52:09,124 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 09:52:09,125 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:09 BoogieIcfgContainer [2019-08-05 09:52:09,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:09,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:09,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:09,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:09,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:08" (1/2) ... [2019-08-05 09:52:09,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c34f67 and model type NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:09, skipping insertion in model container [2019-08-05 09:52:09,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:09" (2/2) ... [2019-08-05 09:52:09,134 INFO L109 eAbstractionObserver]: Analyzing ICFG NonAtomicIncrement_2Threads.bpl [2019-08-05 09:52:09,160 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,161 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,161 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_IncrementProcess1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,165 WARN L317 ript$VariableManager]: TermVariabe Thread1_IncrementProcess2_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:09,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:09,205 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 09:52:09,222 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 09:52:09,246 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:09,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:09,247 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:09,248 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:09,248 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:09,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:09,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:09,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:09,249 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:09,258 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25places, 24 transitions [2019-08-05 09:52:09,278 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94 states. [2019-08-05 09:52:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-08-05 09:52:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:09,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:09,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:09,295 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1599116219, now seen corresponding path program 1 times [2019-08-05 09:52:09,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:09,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:09,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:09,499 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:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:09,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:09,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:09,536 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-08-05 09:52:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:09,576 INFO L93 Difference]: Finished difference Result 86 states and 148 transitions. [2019-08-05 09:52:09,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:09,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 09:52:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:09,595 INFO L225 Difference]: With dead ends: 86 [2019-08-05 09:52:09,595 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 09:52:09,600 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 09:52:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 09:52:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 09:52:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 09:52:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 146 transitions. [2019-08-05 09:52:09,661 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 146 transitions. Word has length 20 [2019-08-05 09:52:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:09,662 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 146 transitions. [2019-08-05 09:52:09,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 146 transitions. [2019-08-05 09:52:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:09,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:09,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:09,665 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1300817559, now seen corresponding path program 1 times [2019-08-05 09:52:09,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:09,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 09:52:09,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:10,401 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:10,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:10,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 09:52:10,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:52:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:52:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:10,405 INFO L87 Difference]: Start difference. First operand 84 states and 146 transitions. Second operand 15 states. [2019-08-05 09:52:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,944 INFO L93 Difference]: Finished difference Result 217 states and 355 transitions. [2019-08-05 09:52:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 09:52:11,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-08-05 09:52:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,947 INFO L225 Difference]: With dead ends: 217 [2019-08-05 09:52:11,947 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 09:52:11,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=468, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:52:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 09:52:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-08-05 09:52:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 09:52:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 177 transitions. [2019-08-05 09:52:11,963 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 177 transitions. Word has length 20 [2019-08-05 09:52:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,964 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 177 transitions. [2019-08-05 09:52:11,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:52:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 177 transitions. [2019-08-05 09:52:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:11,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,968 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1005899275, now seen corresponding path program 2 times [2019-08-05 09:52:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:12,189 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:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:12,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 09:52:12,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:12,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:12,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:12,192 INFO L87 Difference]: Start difference. First operand 102 states and 177 transitions. Second operand 13 states. [2019-08-05 09:52:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:12,876 INFO L93 Difference]: Finished difference Result 261 states and 410 transitions. [2019-08-05 09:52:12,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:52:12,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 09:52:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:12,881 INFO L225 Difference]: With dead ends: 261 [2019-08-05 09:52:12,882 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 09:52:12,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 09:52:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 112. [2019-08-05 09:52:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 09:52:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 188 transitions. [2019-08-05 09:52:12,906 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 188 transitions. Word has length 20 [2019-08-05 09:52:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:12,906 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 188 transitions. [2019-08-05 09:52:12,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 188 transitions. [2019-08-05 09:52:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:12,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:12,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:12,911 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -571067565, now seen corresponding path program 3 times [2019-08-05 09:52:12,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:12,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:13,097 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:13,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 09:52:13,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:13,098 INFO L87 Difference]: Start difference. First operand 112 states and 188 transitions. Second operand 11 states. [2019-08-05 09:52:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:13,510 INFO L93 Difference]: Finished difference Result 165 states and 269 transitions. [2019-08-05 09:52:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:13,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 09:52:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:13,512 INFO L225 Difference]: With dead ends: 165 [2019-08-05 09:52:13,512 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 09:52:13,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:52:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 09:52:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2019-08-05 09:52:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 09:52:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 167 transitions. [2019-08-05 09:52:13,521 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 167 transitions. Word has length 20 [2019-08-05 09:52:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:13,521 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 167 transitions. [2019-08-05 09:52:13,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 167 transitions. [2019-08-05 09:52:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:13,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:13,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:13,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1468032595, now seen corresponding path program 4 times [2019-08-05 09:52:13,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:13,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:13,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:13,638 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:13,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 09:52:13,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:13,640 INFO L87 Difference]: Start difference. First operand 98 states and 167 transitions. Second operand 11 states. [2019-08-05 09:52:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:14,063 INFO L93 Difference]: Finished difference Result 338 states and 541 transitions. [2019-08-05 09:52:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 09:52:14,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 09:52:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:14,069 INFO L225 Difference]: With dead ends: 338 [2019-08-05 09:52:14,069 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 09:52:14,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:52:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 09:52:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 124. [2019-08-05 09:52:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 09:52:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-08-05 09:52:14,082 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 20 [2019-08-05 09:52:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-08-05 09:52:14,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-08-05 09:52:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:14,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:14,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:14,085 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1550488615, now seen corresponding path program 5 times [2019-08-05 09:52:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 09:52:14,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:14,209 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:14,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:14,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 09:52:14,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:52:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:52:14,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:14,211 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 9 states. [2019-08-05 09:52:14,766 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 09:52:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:15,024 INFO L93 Difference]: Finished difference Result 231 states and 370 transitions. [2019-08-05 09:52:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:52:15,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-08-05 09:52:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:15,027 INFO L225 Difference]: With dead ends: 231 [2019-08-05 09:52:15,028 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 09:52:15,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 09:52:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2019-08-05 09:52:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 09:52:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 203 transitions. [2019-08-05 09:52:15,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 203 transitions. Word has length 20 [2019-08-05 09:52:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:15,037 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 203 transitions. [2019-08-05 09:52:15,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:52:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 203 transitions. [2019-08-05 09:52:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:15,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:15,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:15,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1686395449, now seen corresponding path program 6 times [2019-08-05 09:52:15,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:15,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:15,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:15,146 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:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:15,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 09:52:15,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:15,148 INFO L87 Difference]: Start difference. First operand 123 states and 203 transitions. Second operand 11 states. [2019-08-05 09:52:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:15,434 INFO L93 Difference]: Finished difference Result 198 states and 308 transitions. [2019-08-05 09:52:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:52:15,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 09:52:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:15,437 INFO L225 Difference]: With dead ends: 198 [2019-08-05 09:52:15,437 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 09:52:15,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:52:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 09:52:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2019-08-05 09:52:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 09:52:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 164 transitions. [2019-08-05 09:52:15,444 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 164 transitions. Word has length 20 [2019-08-05 09:52:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 164 transitions. [2019-08-05 09:52:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 164 transitions. [2019-08-05 09:52:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:15,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:15,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:15,446 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -505273423, now seen corresponding path program 7 times [2019-08-05 09:52:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:15,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 09:52:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:15,763 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:15,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:15,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 09:52:15,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:52:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:52:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:15,765 INFO L87 Difference]: Start difference. First operand 99 states and 164 transitions. Second operand 9 states. [2019-08-05 09:52:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:15,950 INFO L93 Difference]: Finished difference Result 185 states and 305 transitions. [2019-08-05 09:52:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:52:15,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-08-05 09:52:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:15,953 INFO L225 Difference]: With dead ends: 185 [2019-08-05 09:52:15,953 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 09:52:15,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 09:52:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 109. [2019-08-05 09:52:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 09:52:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 182 transitions. [2019-08-05 09:52:15,959 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 182 transitions. Word has length 20 [2019-08-05 09:52:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:15,959 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 182 transitions. [2019-08-05 09:52:15,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:52:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 182 transitions. [2019-08-05 09:52:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:15,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:15,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:15,961 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash -17252825, now seen corresponding path program 8 times [2019-08-05 09:52:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:15,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:16,062 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:16,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:16,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 09:52:16,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:16,063 INFO L87 Difference]: Start difference. First operand 109 states and 182 transitions. Second operand 11 states. [2019-08-05 09:52:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:16,417 INFO L93 Difference]: Finished difference Result 237 states and 379 transitions. [2019-08-05 09:52:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:16,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 09:52:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:16,421 INFO L225 Difference]: With dead ends: 237 [2019-08-05 09:52:16,421 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 09:52:16,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 09:52:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 87. [2019-08-05 09:52:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 09:52:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2019-08-05 09:52:16,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 20 [2019-08-05 09:52:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:16,426 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2019-08-05 09:52:16,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2019-08-05 09:52:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:16,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:16,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:16,428 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -422817403, now seen corresponding path program 9 times [2019-08-05 09:52:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:16,466 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 09:52:16,482 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-08-05 09:52:16,483 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:16 BasicIcfg [2019-08-05 09:52:16,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:16,485 INFO L168 Benchmark]: Toolchain (without parser) took 7839.68 ms. Allocated memory was 141.6 MB in the beginning and 237.5 MB in the end (delta: 95.9 MB). Free memory was 111.1 MB in the beginning and 142.7 MB in the end (delta: -31.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:16,486 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 09:52:16,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.51 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:16,488 INFO L168 Benchmark]: Boogie Preprocessor took 21.35 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:16,489 INFO L168 Benchmark]: RCFGBuilder took 417.22 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 97.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:16,490 INFO L168 Benchmark]: TraceAbstraction took 7356.97 ms. Allocated memory was 141.6 MB in the beginning and 237.5 MB in the end (delta: 95.9 MB). Free memory was 97.3 MB in the beginning and 142.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:16,494 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.21 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.51 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.35 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.22 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 97.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7356.97 ms. Allocated memory was 141.6 MB in the beginning and 237.5 MB in the end (delta: 95.9 MB). Free memory was 97.3 MB in the beginning and 142.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: assertion can be violated assertion can be violated We found a FailurePath: [L22] -1 x := 0; VAL [x=0] [L24] FORK -1 fork 1 IncrementProcess1(); VAL [x=0] [L25] FORK -1 fork 2 IncrementProcess2(); VAL [x=0] [L54] 0 localx := x; VAL [localx=0, x=0] [L38] 1 localx := x; VAL [localx=0, localx=0, x=0] [L55] 0 x := localx + 1; VAL [localx=0, localx=0, x=1] [L57] 0 localx := x; VAL [localx=1, localx=0, x=1] [L58] 0 x := localx + 1; VAL [localx=1, localx=0, x=2] [L39] 1 x := localx + 1; VAL [localx=1, localx=0, x=1] [L60] 0 localx := x; VAL [localx=1, localx=0, x=1] [L41] 1 localx := x; VAL [localx=1, localx=1, x=1] [L42] 1 x := localx + 1; VAL [localx=1, localx=1, x=2] [L44] 1 localx := x; VAL [localx=1, localx=2, x=2] [L45] 1 x := localx + 1; VAL [localx=1, localx=2, x=3] [L61] 0 x := localx + 1; VAL [localx=1, localx=2, x=2] [L26] JOIN 1 join 1; VAL [localx=1, localx=2, x=2] [L27] JOIN 0 join 2; VAL [localx=1, localx=2, x=2] [L28] -1 assert x >= 3; VAL [localx=1, localx=2, x=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. UNSAFE Result, 7.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 289 SDtfs, 625 SDslu, 769 SDs, 0 SdLazy, 1720 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=5, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 620 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 9329 SizeOfPredicates, 67 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...