java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/INT_FlaggedConditionalEx2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:41:42,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:41:42,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:41:42,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:41:42,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:41:42,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:41:42,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:41:42,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:41:42,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:41:42,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:41:42,354 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:41:42,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:41:42,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:41:42,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:41:42,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:41:42,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:41:42,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:41:42,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:41:42,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:41:42,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:41:42,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:41:42,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:41:42,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:41:42,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:41:42,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:41:42,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:41:42,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:41:42,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:41:42,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:41:42,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:41:42,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:41:42,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:41:42,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:41:42,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:41:42,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:41:42,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:41:42,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:41:42,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:41:42,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:41:42,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:41:42,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:41:42,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:41:42,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:41:42,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:41:42,430 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:41:42,430 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:41:42,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_FlaggedConditionalEx2.bpl [2019-08-05 10:41:42,431 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_FlaggedConditionalEx2.bpl' [2019-08-05 10:41:42,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:41:42,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:41:42,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:41:42,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:41:42,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:41:42,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,492 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:41:42,492 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:41:42,492 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:41:42,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:41:42,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:41:42,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:41:42,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:41:42,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... [2019-08-05 10:41:42,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:41:42,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:41:42,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:41:42,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:41:42,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:41:42,589 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:41:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:41:42,590 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:41:42,910 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:41:42,911 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:41:42,912 INFO L202 PluginConnector]: Adding new model INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:41:42 BoogieIcfgContainer [2019-08-05 10:41:42,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:41:42,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:41:42,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:41:42,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:41:42,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:41:42" (1/2) ... [2019-08-05 10:41:42,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db8e37 and model type INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:41:42, skipping insertion in model container [2019-08-05 10:41:42,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:41:42" (2/2) ... [2019-08-05 10:41:42,921 INFO L109 eAbstractionObserver]: Analyzing ICFG INT_FlaggedConditionalEx2.bpl [2019-08-05 10:41:42,930 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:41:42,940 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:41:42,965 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:41:43,029 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:41:43,030 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:41:43,030 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:41:43,030 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:41:43,031 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:41:43,031 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:41:43,031 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:41:43,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:41:43,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:41:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 10:41:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:41:43,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:41:43,070 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 10:41:43,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:43,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:43,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:41:43,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:41:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:41:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:41:43,256 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 10:41:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:43,353 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-08-05 10:41:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:41:43,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:41:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:43,372 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:41:43,372 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:41:43,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:41:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:41:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:41:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:41:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 10:41:43,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 2 [2019-08-05 10:41:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:43,409 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 10:41:43,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:41:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 10:41:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:41:43,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:41:43,411 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 891338941, now seen corresponding path program 1 times [2019-08-05 10:41:43,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,488 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 10:41:43,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:43,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:41:43,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:41:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:41:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:41:43,492 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2019-08-05 10:41:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:43,662 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:41:43,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:41:43,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:41:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:43,664 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:41:43,664 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:41:43,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:41:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:41:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-08-05 10:41:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:41:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-08-05 10:41:43,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 6 [2019-08-05 10:41:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:43,670 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-08-05 10:41:43,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:41:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2019-08-05 10:41:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:41:43,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:41:43,672 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 891331005, now seen corresponding path program 1 times [2019-08-05 10:41:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,862 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 10:41:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:41:43,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:41:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:41:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:41:43,865 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2019-08-05 10:41:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,047 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-08-05 10:41:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:41:44,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:41:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,048 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:41:44,048 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:41:44,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:41:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:41:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-08-05 10:41:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:41:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-08-05 10:41:44,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 6 [2019-08-05 10:41:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,053 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-08-05 10:41:44,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:41:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-08-05 10:41:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:41:44,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:44,054 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1861702281, now seen corresponding path program 1 times [2019-08-05 10:41:44,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:44,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:44,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:41:44,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:41:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:41:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:41:44,137 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2019-08-05 10:41:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,271 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2019-08-05 10:41:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:41:44,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:41:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,272 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:41:44,273 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:41:44,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:41:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:41:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:41:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:41:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-08-05 10:41:44,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2019-08-05 10:41:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,277 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-08-05 10:41:44,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:41:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-08-05 10:41:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:41:44,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,278 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:44,278 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1878194749, now seen corresponding path program 2 times [2019-08-05 10:41:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:41:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:41:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:41:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:44,391 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 5 states. [2019-08-05 10:41:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,474 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-08-05 10:41:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:44,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:41:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,476 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:41:44,476 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:41:44,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:41:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:41:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:41:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-08-05 10:41:44,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2019-08-05 10:41:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,484 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-08-05 10:41:44,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:41:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2019-08-05 10:41:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:41:44,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,485 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:44,489 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1905506039, now seen corresponding path program 3 times [2019-08-05 10:41:44,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:44,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:44,605 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 6 states. [2019-08-05 10:41:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,670 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 10:41:44,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:41:44,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:41:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,672 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:41:44,672 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:41:44,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:41:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:41:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:41:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-08-05 10:41:44,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2019-08-05 10:41:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,676 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-08-05 10:41:44,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-08-05 10:41:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:41:44,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,677 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:44,677 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1058853821, now seen corresponding path program 4 times [2019-08-05 10:41:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:44,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:41:44,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:41:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:41:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:44,873 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2019-08-05 10:41:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,931 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-08-05 10:41:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:41:44,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:41:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,933 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:41:44,933 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:41:44,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:41:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:41:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:41:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 10:41:44,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-08-05 10:41:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,938 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 10:41:44,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:41:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 10:41:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:41:44,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,939 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:44,939 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1535271031, now seen corresponding path program 5 times [2019-08-05 10:41:44,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:41:45,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:41:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:41:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:45,060 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-08-05 10:41:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:45,095 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 10:41:45,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:41:45,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:41:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:45,097 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:41:45,097 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:41:45,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:41:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:41:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:41:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 10:41:45,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2019-08-05 10:41:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:45,102 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 10:41:45,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:41:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 10:41:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:41:45,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:45,103 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:45,103 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash -348762819, now seen corresponding path program 6 times [2019-08-05 10:41:45,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:45,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:41:45,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:41:45,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:41:45,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:45,388 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2019-08-05 10:41:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:45,575 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:41:45,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:41:45,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:41:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:45,576 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:41:45,576 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:41:45,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:41:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:41:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:41:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-05 10:41:45,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2019-08-05 10:41:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:45,580 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-05 10:41:45,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:41:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-05 10:41:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:41:45,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:45,581 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:45,581 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2073253385, now seen corresponding path program 7 times [2019-08-05 10:41:45,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:45,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:41:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:41:45,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:41:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:41:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:45,773 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 10 states. [2019-08-05 10:41:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:45,840 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 10:41:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:41:45,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-08-05 10:41:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:45,841 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:41:45,841 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:41:45,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:41:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:41:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:41:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 10:41:45,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2019-08-05 10:41:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:45,845 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 10:41:45,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:41:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 10:41:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:41:45,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:45,846 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:45,846 INFO L418 AbstractCegarLoop]: === Iteration 11 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash -153655619, now seen corresponding path program 8 times [2019-08-05 10:41:45,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:45,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:41:45,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:46,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:41:46,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:41:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:41:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:46,034 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 11 states. [2019-08-05 10:41:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:46,067 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-08-05 10:41:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:41:46,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-08-05 10:41:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:46,068 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:41:46,069 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:41:46,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:41:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:41:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:41:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-08-05 10:41:46,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-08-05 10:41:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:46,073 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-08-05 10:41:46,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:41:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-08-05 10:41:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:41:46,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:46,074 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:46,075 INFO L418 AbstractCegarLoop]: === Iteration 12 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash -468358007, now seen corresponding path program 9 times [2019-08-05 10:41:46,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:46,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:41:46,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:46,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:46,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:41:46,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:41:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:41:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:46,269 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 12 states. [2019-08-05 10:41:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:46,362 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 10:41:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:41:46,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:41:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:46,363 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:41:46,363 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:41:46,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:41:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:41:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:41:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-08-05 10:41:46,367 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-08-05 10:41:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:46,367 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-08-05 10:41:46,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:41:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-08-05 10:41:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:41:46,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:46,369 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:46,369 INFO L418 AbstractCegarLoop]: === Iteration 13 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:46,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1634197443, now seen corresponding path program 10 times [2019-08-05 10:41:46,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:46,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:41:46,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:46,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:46,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:41:46,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:41:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:41:46,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:41:46,665 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 15 states. [2019-08-05 10:41:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:47,105 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-08-05 10:41:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:41:47,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 10:41:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:47,106 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:41:47,106 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:41:47,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:41:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:41:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:41:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:41:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-08-05 10:41:47,114 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2019-08-05 10:41:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:47,115 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-08-05 10:41:47,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:41:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-08-05 10:41:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:41:47,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:47,117 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:47,117 INFO L418 AbstractCegarLoop]: === Iteration 14 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash 879485705, now seen corresponding path program 11 times [2019-08-05 10:41:47,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:47,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:41:47,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:47,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:47,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:41:47,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:41:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:41:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:47,309 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 13 states. [2019-08-05 10:41:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:47,725 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2019-08-05 10:41:47,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:41:47,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-08-05 10:41:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:47,729 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:41:47,729 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:41:47,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:41:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2019-08-05 10:41:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:41:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2019-08-05 10:41:47,735 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 74 transitions. Word has length 17 [2019-08-05 10:41:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:47,736 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 74 transitions. [2019-08-05 10:41:47,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:41:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 74 transitions. [2019-08-05 10:41:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:41:47,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:47,737 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1] [2019-08-05 10:41:47,737 INFO L418 AbstractCegarLoop]: === Iteration 15 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1493307447, now seen corresponding path program 12 times [2019-08-05 10:41:47,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:47,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:41:47,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:41:47,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:41:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:41:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:47,832 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. Second operand 5 states. [2019-08-05 10:41:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:47,886 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2019-08-05 10:41:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:47,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-08-05 10:41:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:47,888 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:41:47,888 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:41:47,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:41:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-08-05 10:41:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:41:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2019-08-05 10:41:47,894 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 20 [2019-08-05 10:41:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:47,895 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2019-08-05 10:41:47,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:41:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2019-08-05 10:41:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:41:47,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:47,896 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:47,896 INFO L418 AbstractCegarLoop]: === Iteration 16 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash -952356777, now seen corresponding path program 1 times [2019-08-05 10:41:47,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:47,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:41:47,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:47,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:47,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:47,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:41:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:41:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:47,987 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand 5 states. [2019-08-05 10:41:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,025 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2019-08-05 10:41:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:48,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:41:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,027 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:41:48,027 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:41:48,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:41:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-08-05 10:41:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:41:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2019-08-05 10:41:48,033 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 21 [2019-08-05 10:41:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,034 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2019-08-05 10:41:48,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:41:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2019-08-05 10:41:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:41:48,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,035 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:48,036 INFO L418 AbstractCegarLoop]: === Iteration 17 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 541709623, now seen corresponding path program 2 times [2019-08-05 10:41:48,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:48,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:41:48,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:48,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:48,245 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand 6 states. [2019-08-05 10:41:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,336 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2019-08-05 10:41:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:41:48,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-08-05 10:41:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,337 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:41:48,337 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:41:48,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:41:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-08-05 10:41:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:41:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2019-08-05 10:41:48,341 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 22 [2019-08-05 10:41:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,342 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2019-08-05 10:41:48,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2019-08-05 10:41:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:41:48,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,343 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:48,343 INFO L418 AbstractCegarLoop]: === Iteration 18 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -386872233, now seen corresponding path program 3 times [2019-08-05 10:41:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:41:48,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:41:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:41:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:48,408 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 7 states. [2019-08-05 10:41:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,476 INFO L93 Difference]: Finished difference Result 57 states and 84 transitions. [2019-08-05 10:41:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:41:48,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 10:41:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,478 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:41:48,478 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:41:48,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:41:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-08-05 10:41:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:41:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2019-08-05 10:41:48,484 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 23 [2019-08-05 10:41:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,485 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2019-08-05 10:41:48,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:41:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2019-08-05 10:41:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:41:48,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,486 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:48,486 INFO L418 AbstractCegarLoop]: === Iteration 19 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 891861303, now seen corresponding path program 4 times [2019-08-05 10:41:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:48,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:41:48,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:41:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:41:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:48,600 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand 8 states. [2019-08-05 10:41:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,686 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2019-08-05 10:41:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:41:48,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:41:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,688 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:41:48,688 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:41:48,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:41:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-08-05 10:41:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:41:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2019-08-05 10:41:48,694 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 24 [2019-08-05 10:41:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,694 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-08-05 10:41:48,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:41:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2019-08-05 10:41:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:41:48,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,695 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:48,696 INFO L418 AbstractCegarLoop]: === Iteration 20 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1877895255, now seen corresponding path program 5 times [2019-08-05 10:41:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:48,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:41:48,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:41:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:41:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:48,859 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand 9 states. [2019-08-05 10:41:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,913 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2019-08-05 10:41:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:41:48,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:41:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,915 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:41:48,915 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:41:48,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:41:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-08-05 10:41:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:41:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2019-08-05 10:41:48,919 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 25 [2019-08-05 10:41:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,919 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2019-08-05 10:41:48,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:41:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2019-08-05 10:41:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:41:48,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,920 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:48,920 INFO L418 AbstractCegarLoop]: === Iteration 21 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1914790601, now seen corresponding path program 6 times [2019-08-05 10:41:48,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:41:49,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:41:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:41:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:49,040 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand 10 states. [2019-08-05 10:41:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,087 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2019-08-05 10:41:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:41:49,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-08-05 10:41:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,088 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:41:49,088 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:41:49,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:41:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-08-05 10:41:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:41:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2019-08-05 10:41:49,093 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 26 [2019-08-05 10:41:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,093 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2019-08-05 10:41:49,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:41:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2019-08-05 10:41:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:41:49,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,095 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:49,095 INFO L418 AbstractCegarLoop]: === Iteration 22 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash 771032151, now seen corresponding path program 7 times [2019-08-05 10:41:49,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:49,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:41:49,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:41:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:41:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:49,199 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 11 states. [2019-08-05 10:41:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,256 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2019-08-05 10:41:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:41:49,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:41:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,259 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:41:49,259 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:41:49,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:41:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-08-05 10:41:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:41:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2019-08-05 10:41:49,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 27 [2019-08-05 10:41:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,262 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2019-08-05 10:41:49,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:41:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2019-08-05 10:41:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:41:49,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,263 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:49,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1867808457, now seen corresponding path program 8 times [2019-08-05 10:41:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:49,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:49,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:49,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:41:49,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:41:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:41:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:49,401 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand 12 states. [2019-08-05 10:41:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,477 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2019-08-05 10:41:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:41:49,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:41:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,479 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:41:49,479 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:41:49,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:41:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-08-05 10:41:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:41:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2019-08-05 10:41:49,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 28 [2019-08-05 10:41:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,483 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2019-08-05 10:41:49,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:41:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2019-08-05 10:41:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:41:49,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,484 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:49,485 INFO L418 AbstractCegarLoop]: === Iteration 24 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2067488681, now seen corresponding path program 9 times [2019-08-05 10:41:49,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:49,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:50,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:50,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:41:50,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:41:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:41:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:50,178 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand 13 states. [2019-08-05 10:41:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:50,232 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2019-08-05 10:41:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:41:50,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-08-05 10:41:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:50,233 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:41:50,234 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:41:50,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:41:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:41:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-08-05 10:41:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-08-05 10:41:50,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 29 [2019-08-05 10:41:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:50,238 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-08-05 10:41:50,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:41:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-08-05 10:41:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:41:50,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:50,239 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:50,239 INFO L418 AbstractCegarLoop]: === Iteration 25 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash 332358967, now seen corresponding path program 10 times [2019-08-05 10:41:50,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:50,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:41:50,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:50,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:50,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:41:50,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:41:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:41:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:41:50,659 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 16 states. [2019-08-05 10:41:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,023 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-08-05 10:41:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:41:51,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 10:41:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,025 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:41:51,025 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:41:51,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:41:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:41:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-08-05 10:41:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:41:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-08-05 10:41:51,029 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 30 [2019-08-05 10:41:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,029 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-08-05 10:41:51,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:41:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-08-05 10:41:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:41:51,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,033 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:51,034 INFO L418 AbstractCegarLoop]: === Iteration 26 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1713192023, now seen corresponding path program 11 times [2019-08-05 10:41:51,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:51,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:41:51,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:51,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:41:51,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:41:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:41:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:41:51,255 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 14 states. [2019-08-05 10:41:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,494 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-08-05 10:41:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:41:51,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-08-05 10:41:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,495 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:41:51,495 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:41:51,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:41:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:41:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2019-08-05 10:41:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:41:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-08-05 10:41:51,497 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2019-08-05 10:41:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,498 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-08-05 10:41:51,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:41:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-08-05 10:41:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:41:51,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,499 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:51,499 INFO L418 AbstractCegarLoop]: === Iteration 27 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 649742385, now seen corresponding path program 12 times [2019-08-05 10:41:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:51,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:41:51,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:41:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:41:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:41:51,646 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 4 states. [2019-08-05 10:41:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,913 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-08-05 10:41:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:51,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-08-05 10:41:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,914 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:41:51,914 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:41:51,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 10:41:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:41:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:41:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:41:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-08-05 10:41:51,916 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 34 [2019-08-05 10:41:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,916 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-08-05 10:41:51,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:41:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-08-05 10:41:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:41:51,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,917 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:51,917 INFO L418 AbstractCegarLoop]: === Iteration 28 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash 649734449, now seen corresponding path program 13 times [2019-08-05 10:41:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:52,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:41:52,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:41:52,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:41:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:41:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:52,281 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 5 states. [2019-08-05 10:41:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:52,592 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-08-05 10:41:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:52,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-08-05 10:41:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:52,593 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:41:52,593 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:41:52,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:41:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-08-05 10:41:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2019-08-05 10:41:52,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 34 [2019-08-05 10:41:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:52,595 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-08-05 10:41:52,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:41:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2019-08-05 10:41:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:41:52,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:52,596 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:52,596 INFO L418 AbstractCegarLoop]: === Iteration 29 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1332823659, now seen corresponding path program 14 times [2019-08-05 10:41:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:52,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:41:52,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:52,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:52,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:41:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:41:52,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:41:52,683 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 5 states. [2019-08-05 10:41:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:52,727 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-08-05 10:41:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:41:52,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:41:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:52,728 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:52,729 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:52,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-08-05 10:41:52,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 35 [2019-08-05 10:41:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:52,732 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-08-05 10:41:52,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:41:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-08-05 10:41:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:41:52,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:52,732 INFO L399 BasicCegarLoop]: trace histogram [12, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:52,733 INFO L418 AbstractCegarLoop]: === Iteration 30 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:52,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1632138417, now seen corresponding path program 15 times [2019-08-05 10:41:52,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:52,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:41:52,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:52,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:41:52,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:41:52,830 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 6 states. [2019-08-05 10:41:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:52,851 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2019-08-05 10:41:52,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:41:52,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-08-05 10:41:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:52,852 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:52,852 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:52,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-08-05 10:41:52,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 36 [2019-08-05 10:41:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:52,855 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-08-05 10:41:52,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-08-05 10:41:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:41:52,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:52,856 INFO L399 BasicCegarLoop]: trace histogram [13, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:52,856 INFO L418 AbstractCegarLoop]: === Iteration 31 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash -943317739, now seen corresponding path program 16 times [2019-08-05 10:41:52,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:52,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:41:52,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:53,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:53,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:41:53,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:41:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:41:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:41:53,001 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 7 states. [2019-08-05 10:41:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:53,026 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-08-05 10:41:53,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:41:53,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-08-05 10:41:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:53,027 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:53,027 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:53,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-08-05 10:41:53,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 37 [2019-08-05 10:41:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:53,029 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-08-05 10:41:53,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:41:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-08-05 10:41:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:41:53,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:53,030 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:53,030 INFO L418 AbstractCegarLoop]: === Iteration 32 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash 821920049, now seen corresponding path program 17 times [2019-08-05 10:41:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:53,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:41:53,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:53,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:53,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:41:53,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:41:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:41:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:41:53,135 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2019-08-05 10:41:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:53,157 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-08-05 10:41:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:41:53,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-08-05 10:41:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:53,159 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:53,159 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:53,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-08-05 10:41:53,162 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 38 [2019-08-05 10:41:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:53,162 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-08-05 10:41:53,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:41:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-08-05 10:41:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:41:53,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:53,163 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:53,163 INFO L418 AbstractCegarLoop]: === Iteration 33 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash -290283371, now seen corresponding path program 18 times [2019-08-05 10:41:53,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:53,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:53,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:53,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:53,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:41:53,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:41:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:41:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:41:53,296 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 9 states. [2019-08-05 10:41:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:53,327 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-08-05 10:41:53,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:41:53,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-08-05 10:41:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:53,328 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:53,329 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:53,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 10:41:53,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 39 [2019-08-05 10:41:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:53,332 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 10:41:53,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:41:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 10:41:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:41:53,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:53,333 INFO L399 BasicCegarLoop]: trace histogram [16, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:53,333 INFO L418 AbstractCegarLoop]: === Iteration 34 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash -408851023, now seen corresponding path program 19 times [2019-08-05 10:41:53,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:53,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:41:53,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 86 proven. 21 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:54,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:54,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:41:54,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:41:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:41:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:41:54,040 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 10 states. [2019-08-05 10:41:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:54,071 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-08-05 10:41:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:41:54,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-08-05 10:41:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:54,072 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:54,073 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:54,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-08-05 10:41:54,076 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2019-08-05 10:41:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:54,076 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-08-05 10:41:54,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:41:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-08-05 10:41:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:41:54,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:54,077 INFO L399 BasicCegarLoop]: trace histogram [17, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:54,077 INFO L418 AbstractCegarLoop]: === Iteration 35 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash 210519061, now seen corresponding path program 20 times [2019-08-05 10:41:54,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:54,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:41:54,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 97 proven. 28 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:54,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:54,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:41:54,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:41:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:41:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:41:54,288 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2019-08-05 10:41:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:54,320 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-08-05 10:41:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:41:54,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-08-05 10:41:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:54,321 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:54,321 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:54,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-08-05 10:41:54,324 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2019-08-05 10:41:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:54,324 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-08-05 10:41:54,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:41:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-08-05 10:41:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:41:54,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:54,325 INFO L399 BasicCegarLoop]: trace histogram [18, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:54,325 INFO L418 AbstractCegarLoop]: === Iteration 36 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2063844815, now seen corresponding path program 21 times [2019-08-05 10:41:54,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:54,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:41:54,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:54,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:41:54,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:41:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:41:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:41:54,495 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 12 states. [2019-08-05 10:41:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:54,553 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-08-05 10:41:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:41:54,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-08-05 10:41:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:54,554 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:54,554 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:54,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:41:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-08-05 10:41:54,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 42 [2019-08-05 10:41:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:54,557 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-08-05 10:41:54,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:41:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-08-05 10:41:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:41:54,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:54,558 INFO L399 BasicCegarLoop]: trace histogram [19, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:54,558 INFO L418 AbstractCegarLoop]: === Iteration 37 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash 445319061, now seen corresponding path program 22 times [2019-08-05 10:41:54,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:54,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:41:54,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 119 proven. 45 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:54,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:54,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:41:54,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:41:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:41:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:41:54,838 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2019-08-05 10:41:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:54,882 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-08-05 10:41:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:41:54,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-08-05 10:41:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:54,883 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:41:54,884 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:41:54,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:41:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:41:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-08-05 10:41:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:41:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-08-05 10:41:54,886 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 43 [2019-08-05 10:41:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:54,886 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-08-05 10:41:54,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:41:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-08-05 10:41:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:41:54,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:54,887 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:41:54,888 INFO L418 AbstractCegarLoop]: === Iteration 38 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:41:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 919987889, now seen corresponding path program 23 times [2019-08-05 10:41:54,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:54,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:41:54,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 129 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 10:41:55,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:55,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:41:55,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:41:55,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:41:55,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:41:55,093 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 17 states. [2019-08-05 10:41:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:55,354 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-08-05 10:41:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:41:55,355 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-08-05 10:41:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:55,355 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:41:55,356 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:41:55,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:41:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:41:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:41:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:41:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:41:55,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-08-05 10:41:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:55,358 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:41:55,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:41:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:41:55,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:41:55,364 INFO L202 PluginConnector]: Adding new model INT_FlaggedConditionalEx2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:41:55 BoogieIcfgContainer [2019-08-05 10:41:55,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:41:55,367 INFO L168 Benchmark]: Toolchain (without parser) took 12905.88 ms. Allocated memory was 133.2 MB in the beginning and 281.0 MB in the end (delta: 147.8 MB). Free memory was 110.7 MB in the beginning and 54.6 MB in the end (delta: 56.1 MB). Peak memory consumption was 203.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,367 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 108.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,369 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,369 INFO L168 Benchmark]: RCFGBuilder took 393.67 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 97.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,370 INFO L168 Benchmark]: TraceAbstraction took 12450.16 ms. Allocated memory was 133.2 MB in the beginning and 281.0 MB in the end (delta: 147.8 MB). Free memory was 96.8 MB in the beginning and 54.6 MB in the end (delta: 42.2 MB). Peak memory consumption was 190.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:55,374 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.18 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 108.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.89 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 393.67 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 97.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12450.16 ms. Allocated memory was 133.2 MB in the beginning and 281.0 MB in the end (delta: 147.8 MB). Free memory was 96.8 MB in the beginning and 54.6 MB in the end (delta: 42.2 MB). Peak memory consumption was 190.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 12.3s OverallTime, 38 OverallIterations, 20 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 522 SDslu, 415 SDs, 0 SdLazy, 1798 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=23, 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, 38 MinimizatonAttempts, 107 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 46645 SizeOfPredicates, 75 NumberOfNonLiveVariables, 3369 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 3064/3737 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...