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/gascake/GasCakeWithJohoFractions01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:39,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:39,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:39,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:39,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:39,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:39,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:39,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:39,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:39,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:39,382 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:39,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:39,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:39,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:39,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:39,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:39,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:39,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:39,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:39,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:39,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:39,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:39,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:39,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:39,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:39,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:39,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:39,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:39,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:39,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:39,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:39,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:39,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:39,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:39,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:39,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:39,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:39,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:39,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:39,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:39,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:39,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:39,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:39,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:39,472 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:39,473 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:39,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01.bpl [2019-08-05 11:16:39,474 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01.bpl' [2019-08-05 11:16:39,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:39,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:39,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:39,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:39,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:39,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,554 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:39,555 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:39,555 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:39,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:39,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:39,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:39,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:39,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/1) ... [2019-08-05 11:16:39,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:39,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:39,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:39,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:39,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (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 11:16:39,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:39,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:39,879 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:39,879 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:16:39,883 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:39 BoogieIcfgContainer [2019-08-05 11:16:39,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:39,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:39,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:39,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:39,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:39" (1/2) ... [2019-08-05 11:16:39,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce35eeb and model type GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:39, skipping insertion in model container [2019-08-05 11:16:39,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:39" (2/2) ... [2019-08-05 11:16:39,896 INFO L109 eAbstractionObserver]: Analyzing ICFG GasCakeWithJohoFractions01.bpl [2019-08-05 11:16:39,906 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:39,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 11:16:39,932 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 11:16:39,964 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:39,965 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:39,965 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:39,965 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:39,965 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:39,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:39,966 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:39,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:39,966 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 11:16:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:16:39,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:16:39,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 11:16:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,127 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 11:16:40,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:16:40,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:16:40,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:16:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:16:40,170 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 11:16:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,291 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:16:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:40,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:16:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,304 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:16:40,305 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:16:40,307 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 11:16:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:16:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:16:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:16:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:16:40,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 2 [2019-08-05 11:16:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,343 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:16:40,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:16:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:16:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:16:40,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:16:40,345 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash 926597, now seen corresponding path program 1 times [2019-08-05 11:16:40,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,560 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 11:16:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:40,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:40,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:40,564 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-08-05 11:16:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,785 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:16:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:40,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:16:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,787 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:16:40,787 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:16:40,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:16:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:16:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:16:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:16:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:16:40,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 4 [2019-08-05 11:16:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,792 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:16:40,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:16:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:16:40,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:16:40,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28724547, now seen corresponding path program 1 times [2019-08-05 11:16:40,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,878 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 11:16:40,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:40,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:40,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:40,881 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-08-05 11:16:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,020 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:16:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:41,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:16:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,021 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:41,021 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:41,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 11:16:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 11:16:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:16:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:16:41,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2019-08-05 11:16:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,025 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:16:41,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:16:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:16:41,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:16:41,027 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash 890460990, now seen corresponding path program 1 times [2019-08-05 11:16:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:16:41,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:41,305 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-08-05 11:16:41,475 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-08-05 11:16:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,567 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:16:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:41,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:16:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,568 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:16:41,568 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:16:41,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:16:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:16:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:16:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:16:41,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2019-08-05 11:16:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,572 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:16:41,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:16:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:16:41,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,573 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:16:41,574 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1034520640, now seen corresponding path program 1 times [2019-08-05 11:16:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:41,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:41,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:41,708 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-08-05 11:16:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,858 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:16:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:41,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:16:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,861 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:41,862 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:41,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:16:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:16:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:16:41,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-08-05 11:16:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,865 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:16:41,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:16:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:41,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,866 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:16:41,867 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2005368808, now seen corresponding path program 1 times [2019-08-05 11:16:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:16:41,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:41,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:41,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:41,977 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-08-05 11:16:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,105 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:16:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:42,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:16:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,107 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:42,107 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:42,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 11:16:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 11:16:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:16:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:16:42,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2019-08-05 11:16:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,110 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:16:42,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:16:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:16:42,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1] [2019-08-05 11:16:42,112 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2036890937, now seen corresponding path program 2 times [2019-08-05 11:16:42,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:42,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:42,289 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2019-08-05 11:16:42,654 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-08-05 11:16:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,712 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:16:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:42,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:16:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,713 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:16:42,714 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:16:42,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:16:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:16:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:16:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:16:42,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2019-08-05 11:16:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,717 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:16:42,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:16:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:16:42,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-08-05 11:16:42,719 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1052895365, now seen corresponding path program 2 times [2019-08-05 11:16:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:16:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:16:42,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:42,777 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2019-08-05 11:16:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,799 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:16:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:42,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-08-05 11:16:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,800 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:16:42,801 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:16:42,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:16:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:16:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:16:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:16:42,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-05 11:16:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,805 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:16:42,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:16:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:42,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,806 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1] [2019-08-05 11:16:42,806 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1719982093, now seen corresponding path program 2 times [2019-08-05 11:16:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:42,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:42,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:42,945 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2019-08-05 11:16:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,992 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:16:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:42,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 11:16:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,994 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:16:42,994 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:16:42,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:16:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-08-05 11:16:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:16:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:16:42,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 13 [2019-08-05 11:16:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,999 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:16:43,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:16:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:16:43,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:43,001 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1] [2019-08-05 11:16:43,001 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 11:16:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1779837364, now seen corresponding path program 3 times [2019-08-05 11:16:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:43,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:16:43,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:16:43,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:43,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:16:43,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:43,132 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2019-08-05 11:16:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:43,144 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:16:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:43,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 11:16:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:43,150 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:16:43,150 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:16:43,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:16:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:16:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:16:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:16:43,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-08-05 11:16:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:43,152 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:16:43,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:16:43,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:16:43,157 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:43 BoogieIcfgContainer [2019-08-05 11:16:43,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:43,160 INFO L168 Benchmark]: Toolchain (without parser) took 3643.60 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 110.0 MB in the beginning and 61.4 MB in the end (delta: 48.6 MB). Peak memory consumption was 85.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,161 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,163 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,163 INFO L168 Benchmark]: RCFGBuilder took 296.04 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 97.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,165 INFO L168 Benchmark]: TraceAbstraction took 3273.21 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 97.0 MB in the beginning and 61.4 MB in the end (delta: 35.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:43,169 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.80 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 296.04 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 97.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3273.21 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 97.0 MB in the beginning and 61.4 MB in the end (delta: 35.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 26]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 15]: 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 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 3.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 63 SDslu, 1 SDs, 0 SdLazy, 168 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 5548 SizeOfPredicates, 8 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 25/51 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...