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/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:42:19,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:42:19,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:42:19,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:42:19,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:42:19,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:42:19,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:42:19,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:42:19,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:42:19,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:42:19,428 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:42:19,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:42:19,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:42:19,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:42:19,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:42:19,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:42:19,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:42:19,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:42:19,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:42:19,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:42:19,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:42:19,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:42:19,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:42:19,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:42:19,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:42:19,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:42:19,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:42:19,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:42:19,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:42:19,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:42:19,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:42:19,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:42:19,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:42:19,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:42:19,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:42:19,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:42:19,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:42:19,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:42:19,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:42:19,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:42:19,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:42:19,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:42:19,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:42:19,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:42:19,520 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:42:19,521 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:42:19,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2019-08-04 21:42:19,522 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2019-08-04 21:42:19,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:42:19,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:42:19,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:42:19,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:42:19,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:42:19,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:42:19,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:42:19,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:42:19,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:42:19,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/1) ... [2019-08-04 21:42:19,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:42:19,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:42:19,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:42:19,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:42:19,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (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-04 21:42:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:42:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:42:19,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:42:19,845 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:42:19,846 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:42:19 BoogieIcfgContainer [2019-08-04 21:42:19,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:42:19,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:42:19,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:42:19,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:42:19,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:42:19" (1/2) ... [2019-08-04 21:42:19,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f33d4c and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:42:19, skipping insertion in model container [2019-08-04 21:42:19,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:42:19" (2/2) ... [2019-08-04 21:42:19,854 INFO L109 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2019-08-04 21:42:19,864 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:42:19,871 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:42:19,888 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:42:19,918 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:42:19,919 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:42:19,919 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:42:19,919 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:42:19,919 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:42:19,920 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:42:19,920 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:42:19,920 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:42:19,920 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:42:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:42:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:42:19,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:19,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:42:19,951 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-04 21:42:20,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:20,091 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-04 21:42:20,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:42:20,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:42:20,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:42:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:42:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:42:20,117 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:42:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:20,176 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:42:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:42:20,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:42:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:20,190 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:42:20,190 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:42:20,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 21:42:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:42:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:42:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:42:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:42:20,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:42:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:20,226 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:42:20,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:42:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:42:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:42:20,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:20,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:42:20,228 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-04 21:42:20,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:20,375 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-04 21:42:20,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:20,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:42:20,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:42:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:42:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:42:20,379 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:42:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:20,468 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:42:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:42:20,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:42:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:20,472 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:42:20,472 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:42:20,474 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-04 21:42:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:42:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:42:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:42:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:42:20,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:42:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:20,477 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:42:20,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:42:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:42:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:42:20,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:20,479 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:42:20,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-04 21:42:20,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:20,687 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-04 21:42:20,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:20,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:42:20,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:42:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:42:20,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:42:20,689 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:42:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:20,737 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:42:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:42:20,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:42:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:20,738 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:42:20,738 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:42:20,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:42:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:42:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:42:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:42:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:42:20,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:42:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:20,742 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:42:20,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:42:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:42:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:42:20,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:20,743 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:42:20,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-04 21:42:20,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:20,857 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-04 21:42:20,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:20,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:42:20,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:42:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:42:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:42:20,859 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:42:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:20,896 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:42:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:42:20,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:42:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:20,897 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:42:20,897 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:42:20,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-04 21:42:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:42:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:42:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:42:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:42:20,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:42:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:20,902 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:42:20,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:42:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:42:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:42:20,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:20,903 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:42:20,903 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-04 21:42:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:21,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:42:21,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:42:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:42:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:42:21,123 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:42:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:21,146 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:42:21,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:42:21,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:42:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:21,148 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:42:21,149 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:42:21,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-04 21:42:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:42:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:42:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:42:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:42:21,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:42:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:21,155 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:42:21,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:42:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:42:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:42:21,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:21,156 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:42:21,156 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-04 21:42:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:21,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:42:21,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:21,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:21,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:42:21,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:42:21,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:42:21,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:42:21,426 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:42:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:21,453 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:42:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:42:21,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:42:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:21,454 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:42:21,454 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:42:21,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:42:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:42:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:42:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:42:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:42:21,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:42:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:21,458 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:42:21,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:42:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:42:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:42:21,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:21,459 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:42:21,460 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-04 21:42:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:21,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:42:21,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:21,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:42:21,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:42:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:42:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:42:21,742 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:42:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:21,807 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:42:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:42:21,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:42:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:21,809 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:42:21,809 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:42:21,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-04 21:42:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:42:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:42:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:42:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:42:21,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:42:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:21,813 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:42:21,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:42:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:42:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:42:21,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:21,814 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:42:21,814 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-04 21:42:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:21,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:42:21,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:42:22,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:42:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:42:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:42:22,017 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:42:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:22,049 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:42:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:42:22,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:42:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:22,051 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:42:22,051 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:42:22,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-04 21:42:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:42:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:42:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:42:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:42:22,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:42:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:22,054 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:42:22,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:42:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:42:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:42:22,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:22,055 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:42:22,056 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-04 21:42:22,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:22,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:42:22,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:22,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:22,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:42:22,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:42:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:42:22,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:42:22,506 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:42:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:22,532 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:42:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:42:22,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:42:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:22,533 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:42:22,534 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:42:22,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:42:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:42:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:42:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:42:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:42:22,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:42:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:22,537 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:42:22,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:42:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:42:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:42:22,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:22,538 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:42:22,538 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:22,539 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-04 21:42:22,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:22,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:42:22,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:22,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:42:22,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-04 21:42:22,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:42:22,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:42:22,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:42:22,716 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:42:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:22,769 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:42:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:42:22,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:42:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:22,770 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:42:22,770 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:42:22,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-04 21:42:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:42:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:42:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:42:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:42:22,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-04 21:42:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:22,772 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:42:22,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:42:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:42:22,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:42:22,777 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:42:22 BoogieIcfgContainer [2019-08-04 21:42:22,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:42:22,780 INFO L168 Benchmark]: Toolchain (without parser) took 3220.10 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 109.5 MB in the beginning and 73.2 MB in the end (delta: 36.2 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,781 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.99 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 107.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,783 INFO L168 Benchmark]: Boogie Preprocessor took 24.78 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,784 INFO L168 Benchmark]: RCFGBuilder took 223.51 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 97.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,785 INFO L168 Benchmark]: TraceAbstraction took 2929.66 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 97.3 MB in the beginning and 73.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:22,789 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 140.0 MB. Free memory was 110.7 MB in the beginning and 110.5 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 36.99 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 107.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.78 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 223.51 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 97.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2929.66 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 97.3 MB in the beginning and 73.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 3 SDslu, 27 SDs, 0 SdLazy, 105 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407 SizeOfPredicates, 8 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 45/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...