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/Fischer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:05,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:05,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:05,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:05,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:05,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:05,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:05,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:05,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:05,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:05,343 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:05,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:05,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:05,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:05,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:05,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:05,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:05,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:05,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:05,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:05,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:05,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:05,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:05,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:05,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:05,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:05,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:05,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:05,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:05,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:05,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:05,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:05,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:05,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:05,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:05,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:05,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:05,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:05,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:05,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:05,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:05,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:05,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:05,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:05,422 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:05,422 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:05,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/Fischer.bpl [2019-08-05 09:52:05,423 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/Fischer.bpl' [2019-08-05 09:52:05,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:05,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:05,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:05,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:05,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:05,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:05,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:05,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:05,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:05,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Fischer.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,593 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2019-08-05 09:52:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2019-08-05 09:52:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2019-08-05 09:52:05,593 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2019-08-05 09:52:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2019-08-05 09:52:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2019-08-05 09:52:05,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 09:52:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:52:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:52:05,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2019-08-05 09:52:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2019-08-05 09:52:05,595 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2019-08-05 09:52:05,596 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,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:52:06,155 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 09:52:06,156 INFO L202 PluginConnector]: Adding new model Fischer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06 BoogieIcfgContainer [2019-08-05 09:52:06,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:06,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:06,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:06,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:06,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fischer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/2) ... [2019-08-05 09:52:06,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3268e5d9 and model type Fischer.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,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fischer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06" (2/2) ... [2019-08-05 09:52:06,167 INFO L109 eAbstractionObserver]: Analyzing ICFG Fischer.bpl [2019-08-05 09:52:06,202 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,203 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,203 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,203 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,204 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,205 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,205 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,206 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:06,237 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 09:52:06,253 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 09:52:06,274 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:06,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:06,275 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:06,275 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:06,276 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:06,276 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:06,276 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:06,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:06,276 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:06,286 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42places, 43 transitions [2019-08-05 09:52:06,395 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1403 states. [2019-08-05 09:52:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states. [2019-08-05 09:52:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:52:06,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,410 INFO L418 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -559810684, now seen corresponding path program 1 times [2019-08-05 09:52:06,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,544 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,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:52:06,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,566 INFO L87 Difference]: Start difference. First operand 1403 states. Second operand 3 states. [2019-08-05 09:52:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:06,698 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2019-08-05 09:52:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 09:52:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:06,724 INFO L225 Difference]: With dead ends: 398 [2019-08-05 09:52:06,724 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 09:52:06,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 09:52:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2019-08-05 09:52:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-08-05 09:52:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2019-08-05 09:52:06,858 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 8 [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 394 states and 1372 transitions. [2019-08-05 09:52:06,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2019-08-05 09:52:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:06,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,865 INFO L418 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1193651605, now seen corresponding path program 1 times [2019-08-05 09:52:06,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,910 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,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:06,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,913 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 3 states. [2019-08-05 09:52:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,061 INFO L93 Difference]: Finished difference Result 619 states and 2131 transitions. [2019-08-05 09:52:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 09:52:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,068 INFO L225 Difference]: With dead ends: 619 [2019-08-05 09:52:07,068 INFO L226 Difference]: Without dead ends: 523 [2019-08-05 09:52:07,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-08-05 09:52:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 403. [2019-08-05 09:52:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-08-05 09:52:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1343 transitions. [2019-08-05 09:52:07,101 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1343 transitions. Word has length 12 [2019-08-05 09:52:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,101 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 1343 transitions. [2019-08-05 09:52:07,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1343 transitions. [2019-08-05 09:52:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:07,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,107 INFO L418 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1705758895, now seen corresponding path program 2 times [2019-08-05 09:52:07,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,151 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,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,153 INFO L87 Difference]: Start difference. First operand 403 states and 1343 transitions. Second operand 3 states. [2019-08-05 09:52:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,309 INFO L93 Difference]: Finished difference Result 511 states and 1701 transitions. [2019-08-05 09:52:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 09:52:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,313 INFO L225 Difference]: With dead ends: 511 [2019-08-05 09:52:07,314 INFO L226 Difference]: Without dead ends: 511 [2019-08-05 09:52:07,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-08-05 09:52:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2019-08-05 09:52:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-08-05 09:52:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1523 transitions. [2019-08-05 09:52:07,344 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1523 transitions. Word has length 12 [2019-08-05 09:52:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,345 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 1523 transitions. [2019-08-05 09:52:07,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1523 transitions. [2019-08-05 09:52:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:07,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,353 INFO L418 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash -912021128, now seen corresponding path program 1 times [2019-08-05 09:52:07,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,421 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,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,423 INFO L87 Difference]: Start difference. First operand 459 states and 1523 transitions. Second operand 3 states. [2019-08-05 09:52:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,545 INFO L93 Difference]: Finished difference Result 531 states and 1759 transitions. [2019-08-05 09:52:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 09:52:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,551 INFO L225 Difference]: With dead ends: 531 [2019-08-05 09:52:07,551 INFO L226 Difference]: Without dead ends: 531 [2019-08-05 09:52:07,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-08-05 09:52:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 507. [2019-08-05 09:52:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-05 09:52:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1675 transitions. [2019-08-05 09:52:07,574 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1675 transitions. Word has length 19 [2019-08-05 09:52:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,574 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 1675 transitions. [2019-08-05 09:52:07,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1675 transitions. [2019-08-05 09:52:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:07,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,580 INFO L418 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -270419216, now seen corresponding path program 2 times [2019-08-05 09:52:07,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,631 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,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,636 INFO L87 Difference]: Start difference. First operand 507 states and 1675 transitions. Second operand 3 states. [2019-08-05 09:52:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,723 INFO L93 Difference]: Finished difference Result 543 states and 1776 transitions. [2019-08-05 09:52:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 09:52:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,727 INFO L225 Difference]: With dead ends: 543 [2019-08-05 09:52:07,727 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 09:52:07,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 09:52:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 423. [2019-08-05 09:52:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-08-05 09:52:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1364 transitions. [2019-08-05 09:52:07,742 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1364 transitions. Word has length 19 [2019-08-05 09:52:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,743 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 1364 transitions. [2019-08-05 09:52:07,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1364 transitions. [2019-08-05 09:52:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 09:52:07,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,745 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, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,746 INFO L418 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1489600863, now seen corresponding path program 1 times [2019-08-05 09:52:07,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,859 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,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:07,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:07,860 INFO L87 Difference]: Start difference. First operand 423 states and 1364 transitions. Second operand 4 states. [2019-08-05 09:52:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:08,163 INFO L93 Difference]: Finished difference Result 443 states and 1406 transitions. [2019-08-05 09:52:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:08,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-08-05 09:52:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:08,168 INFO L225 Difference]: With dead ends: 443 [2019-08-05 09:52:08,168 INFO L226 Difference]: Without dead ends: 443 [2019-08-05 09:52:08,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-08-05 09:52:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-08-05 09:52:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-08-05 09:52:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1406 transitions. [2019-08-05 09:52:08,185 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1406 transitions. Word has length 26 [2019-08-05 09:52:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:08,185 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 1406 transitions. [2019-08-05 09:52:08,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1406 transitions. [2019-08-05 09:52:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:52:08,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:08,188 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:08,188 INFO L418 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:08,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1043842840, now seen corresponding path program 1 times [2019-08-05 09:52:08,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:08,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:08,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:08,395 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:08,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 09:52:08,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:08,397 INFO L87 Difference]: Start difference. First operand 443 states and 1406 transitions. Second operand 6 states. [2019-08-05 09:52:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:08,679 INFO L93 Difference]: Finished difference Result 513 states and 1593 transitions. [2019-08-05 09:52:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:52:08,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 09:52:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:08,685 INFO L225 Difference]: With dead ends: 513 [2019-08-05 09:52:08,685 INFO L226 Difference]: Without dead ends: 429 [2019-08-05 09:52:08,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:52:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-08-05 09:52:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-08-05 09:52:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-08-05 09:52:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1365 transitions. [2019-08-05 09:52:08,713 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1365 transitions. Word has length 27 [2019-08-05 09:52:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:08,714 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 1365 transitions. [2019-08-05 09:52:08,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1365 transitions. [2019-08-05 09:52:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:52:08,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:08,715 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:08,716 INFO L418 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -970343252, now seen corresponding path program 2 times [2019-08-05 09:52:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:08,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:08,817 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:08,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:08,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:08,819 INFO L87 Difference]: Start difference. First operand 429 states and 1365 transitions. Second operand 4 states. [2019-08-05 09:52:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:08,972 INFO L93 Difference]: Finished difference Result 450 states and 1409 transitions. [2019-08-05 09:52:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:08,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-08-05 09:52:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:08,976 INFO L225 Difference]: With dead ends: 450 [2019-08-05 09:52:08,976 INFO L226 Difference]: Without dead ends: 450 [2019-08-05 09:52:08,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-08-05 09:52:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-08-05 09:52:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-08-05 09:52:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1409 transitions. [2019-08-05 09:52:08,989 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1409 transitions. Word has length 27 [2019-08-05 09:52:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:08,989 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 1409 transitions. [2019-08-05 09:52:08,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1409 transitions. [2019-08-05 09:52:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:52:08,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:08,991 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 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:08,992 INFO L418 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:08,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1323271117, now seen corresponding path program 3 times [2019-08-05 09:52:08,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:09,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:09,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:09,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:09,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 09:52:09,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:09,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:09,349 INFO L87 Difference]: Start difference. First operand 450 states and 1409 transitions. Second operand 6 states. [2019-08-05 09:52:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:09,579 INFO L93 Difference]: Finished difference Result 244 states and 724 transitions. [2019-08-05 09:52:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:52:09,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-08-05 09:52:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:09,580 INFO L225 Difference]: With dead ends: 244 [2019-08-05 09:52:09,580 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 09:52:09,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:52:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 09:52:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 09:52:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 09:52:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 09:52:09,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-08-05 09:52:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:09,583 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 09:52:09,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 09:52:09,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 09:52:09,586 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-08-05 09:52:09,588 INFO L202 PluginConnector]: Adding new model Fischer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:09 BasicIcfg [2019-08-05 09:52:09,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:09,591 INFO L168 Benchmark]: Toolchain (without parser) took 4132.78 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 109.2 MB in the beginning and 127.2 MB in the end (delta: -18.0 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:09,592 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 131.6 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 09:52:09,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.33 ms. Allocated memory is still 131.6 MB. Free memory was 108.8 MB in the beginning and 107.1 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:09,594 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 131.6 MB. Free memory was 107.1 MB in the beginning and 105.8 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:09,595 INFO L168 Benchmark]: RCFGBuilder took 625.42 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 92.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:09,596 INFO L168 Benchmark]: TraceAbstraction took 3430.93 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 92.5 MB in the beginning and 127.2 MB in the end (delta: -34.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:09,600 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 131.6 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.33 ms. Allocated memory is still 131.6 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 131.6 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.42 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 92.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3430.93 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 92.5 MB in the beginning and 127.2 MB in the end (delta: -34.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 78]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 4 error locations. SAFE Result, 3.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 411 SDtfs, 281 SDslu, 380 SDs, 0 SdLazy, 198 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=0, 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 224 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 9259 SizeOfPredicates, 22 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...