java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:29:36,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:29:36,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:36,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:36,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:36,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:36,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:36,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:36,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:36,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:36,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:36,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:36,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:36,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:36,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:36,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:36,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:36,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:36,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:36,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:36,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:36,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:36,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:36,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:36,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:36,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:36,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:36,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:36,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:36,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:36,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:36,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:36,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:36,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:36,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:36,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:36,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:29:36,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:36,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:36,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:36,255 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:36,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:36,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:36,255 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:36,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:36,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:36,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:36,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:36,338 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:36,338 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:36,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2018-07-25 13:29:36,339 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2018-07-25 13:29:36,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:36,396 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:36,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:36,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:36,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:36,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:36,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:36,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:36,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:36,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:36,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:36,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:36,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:36,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:36,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:36,739 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:36,740 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:36 BoogieIcfgContainer [2018-07-25 13:29:36,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:36,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:36,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:36,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:36,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:36" (1/2) ... [2018-07-25 13:29:36,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456a957a and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:36, skipping insertion in model container [2018-07-25 13:29:36,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:36" (2/2) ... [2018-07-25 13:29:36,752 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2018-07-25 13:29:36,762 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:36,771 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:36,813 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:36,814 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:36,814 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:36,814 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:36,814 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:36,814 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:36,815 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:36,815 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:36,815 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-07-25 13:29:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:29:36,837 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:36,838 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:36,839 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2018-07-25 13:29:36,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:36,936 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:36,937 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:36,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:36,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:36,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:36,956 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-07-25 13:29:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,020 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-07-25 13:29:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:37,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-07-25 13:29:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,039 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:29:37,039 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:29:37,043 INFO L574 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 [2018-07-25 13:29:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:29:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-07-25 13:29:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:29:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-07-25 13:29:37,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2018-07-25 13:29:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,084 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-07-25 13:29:37,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-07-25 13:29:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:29:37,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,085 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:37,085 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1897140361, now seen corresponding path program 1 times [2018-07-25 13:29:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,144 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:29:37,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:37,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:37,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:37,147 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-07-25 13:29:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,227 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-07-25 13:29:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:37,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 13:29:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,230 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:29:37,231 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:29:37,232 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:29:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-07-25 13:29:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:29:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-07-25 13:29:37,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-07-25 13:29:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,238 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-07-25 13:29:37,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-07-25 13:29:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:29:37,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,240 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:37,240 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1765322045, now seen corresponding path program 2 times [2018-07-25 13:29:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:37,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:37,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:37,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:37,309 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2018-07-25 13:29:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,484 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-07-25 13:29:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:37,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-07-25 13:29:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,486 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:29:37,488 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:29:37,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:29:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2018-07-25 13:29:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:29:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-07-25 13:29:37,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-07-25 13:29:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,501 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-07-25 13:29:37,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-07-25 13:29:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:29:37,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,504 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:37,504 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash 481488509, now seen corresponding path program 3 times [2018-07-25 13:29:37,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:37,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:37,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:37,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:37,592 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2018-07-25 13:29:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,735 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-07-25 13:29:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:37,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-07-25 13:29:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,736 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:29:37,737 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:29:37,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:29:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 19. [2018-07-25 13:29:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:29:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-07-25 13:29:37,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2018-07-25 13:29:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,744 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-07-25 13:29:37,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-07-25 13:29:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:29:37,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,745 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:37,746 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -702118985, now seen corresponding path program 4 times [2018-07-25 13:29:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:37,802 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:37,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:37,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:37,805 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 7 states. [2018-07-25 13:29:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,958 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-07-25 13:29:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:29:37,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 13:29:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,960 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:29:37,960 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:29:37,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:29:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 21. [2018-07-25 13:29:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:29:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-07-25 13:29:37,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2018-07-25 13:29:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,968 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-07-25 13:29:37,968 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-07-25 13:29:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:29:37,969 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,969 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:37,969 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 17412721, now seen corresponding path program 5 times [2018-07-25 13:29:37,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:38,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:29:38,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:29:38,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:38,046 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2018-07-25 13:29:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,203 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-07-25 13:29:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:29:38,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-25 13:29:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,205 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:29:38,205 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:29:38,206 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:29:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 23. [2018-07-25 13:29:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:29:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-07-25 13:29:38,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2018-07-25 13:29:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,216 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-07-25 13:29:38,216 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:29:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-07-25 13:29:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:29:38,220 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,220 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:38,221 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2352469, now seen corresponding path program 6 times [2018-07-25 13:29:38,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:29:38,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:29:38,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:29:38,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:38,287 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-07-25 13:29:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,443 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-07-25 13:29:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:29:38,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-07-25 13:29:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,445 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:29:38,445 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:29:38,448 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:29:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 25. [2018-07-25 13:29:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:29:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-07-25 13:29:38,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2018-07-25 13:29:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,465 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-07-25 13:29:38,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:29:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-07-25 13:29:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:29:38,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,468 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:38,468 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1816830875, now seen corresponding path program 7 times [2018-07-25 13:29:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,528 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:29:38,529 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:29:38,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:29:38,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:38,530 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2018-07-25 13:29:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,682 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2018-07-25 13:29:38,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:29:38,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-25 13:29:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,684 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:29:38,684 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:29:38,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:29:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 27. [2018-07-25 13:29:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:29:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-07-25 13:29:38,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-07-25 13:29:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,691 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-07-25 13:29:38,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:29:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-07-25 13:29:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:29:38,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,693 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:38,693 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1773856865, now seen corresponding path program 8 times [2018-07-25 13:29:38,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:29:38,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:29:38,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:29:38,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:38,755 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2018-07-25 13:29:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,940 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-07-25 13:29:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:29:38,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-07-25 13:29:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,942 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:29:38,942 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:29:38,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:29:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. [2018-07-25 13:29:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:29:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-25 13:29:38,949 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-07-25 13:29:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,950 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-25 13:29:38,950 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:29:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-25 13:29:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:29:38,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,951 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:38,952 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 869461081, now seen corresponding path program 9 times [2018-07-25 13:29:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:39,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:29:39,016 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:29:39,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:29:39,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:39,017 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 12 states. [2018-07-25 13:29:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,193 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-07-25 13:29:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:29:39,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-07-25 13:29:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,194 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:29:39,195 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:29:39,195 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:29:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 31. [2018-07-25 13:29:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:29:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-07-25 13:29:39,201 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-07-25 13:29:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,202 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-07-25 13:29:39,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:29:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-07-25 13:29:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:29:39,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,203 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,204 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1522632045, now seen corresponding path program 10 times [2018-07-25 13:29:39,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,254 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:39,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:39,255 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:39,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:39,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:39,256 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-07-25 13:29:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,262 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-07-25 13:29:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:39,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-25 13:29:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,263 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:29:39,263 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:29:39,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:29:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:29:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:29:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-07-25 13:29:39,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-07-25 13:29:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,275 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-07-25 13:29:39,275 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-07-25 13:29:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:29:39,277 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,277 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,278 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 50698691, now seen corresponding path program 1 times [2018-07-25 13:29:39,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:39,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:39,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:39,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:39,317 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-07-25 13:29:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,326 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-07-25 13:29:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:39,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-07-25 13:29:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,327 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:29:39,327 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:29:39,328 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:29:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-07-25 13:29:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:29:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-07-25 13:29:39,335 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-07-25 13:29:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,336 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-07-25 13:29:39,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-07-25 13:29:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:29:39,339 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,339 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,340 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1544539549, now seen corresponding path program 2 times [2018-07-25 13:29:39,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:39,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:39,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:39,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:39,382 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-07-25 13:29:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,394 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-07-25 13:29:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:39,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-07-25 13:29:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,395 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:29:39,395 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:29:39,396 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:29:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:29:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:29:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-07-25 13:29:39,401 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-07-25 13:29:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,402 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-07-25 13:29:39,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-07-25 13:29:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:29:39,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,403 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,404 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1688440073, now seen corresponding path program 3 times [2018-07-25 13:29:39,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:39,456 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:39,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:39,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:39,460 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-07-25 13:29:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,474 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-07-25 13:29:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:39,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-07-25 13:29:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,477 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:29:39,477 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:29:39,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:29:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:29:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:29:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-07-25 13:29:39,489 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-07-25 13:29:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,490 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-07-25 13:29:39,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-07-25 13:29:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:29:39,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,491 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,491 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 974465489, now seen corresponding path program 4 times [2018-07-25 13:29:39,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:39,550 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:39,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:39,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:39,551 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2018-07-25 13:29:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,574 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-07-25 13:29:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:29:39,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-07-25 13:29:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,575 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:29:39,576 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:29:39,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:29:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:29:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:29:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-07-25 13:29:39,587 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-07-25 13:29:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,587 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-07-25 13:29:39,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-07-25 13:29:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:29:39,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,590 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,590 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash 226202155, now seen corresponding path program 5 times [2018-07-25 13:29:39,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:29:39,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:29:39,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:29:39,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:39,644 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2018-07-25 13:29:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,667 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-07-25 13:29:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:29:39,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-07-25 13:29:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,669 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:29:39,669 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:29:39,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:29:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:29:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:29:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-07-25 13:29:39,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-07-25 13:29:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,677 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-07-25 13:29:39,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:29:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-07-25 13:29:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:29:39,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,679 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,680 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1595323387, now seen corresponding path program 6 times [2018-07-25 13:29:39,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:29:39,730 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:29:39,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:29:39,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:39,731 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 9 states. [2018-07-25 13:29:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,756 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-07-25 13:29:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:29:39,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-07-25 13:29:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,758 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:29:39,758 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:29:39,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:29:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:29:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:29:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-07-25 13:29:39,764 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-07-25 13:29:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,764 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-07-25 13:29:39,764 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:29:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-07-25 13:29:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:29:39,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,765 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,766 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash 265287519, now seen corresponding path program 7 times [2018-07-25 13:29:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:29:39,821 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:29:39,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:29:39,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:39,822 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 10 states. [2018-07-25 13:29:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,854 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-07-25 13:29:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:29:39,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-07-25 13:29:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,855 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:29:39,855 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:29:39,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:29:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:29:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:29:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-07-25 13:29:39,862 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 46 [2018-07-25 13:29:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,862 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-07-25 13:29:39,862 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:29:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-07-25 13:29:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:29:39,863 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,864 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:39,864 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1605973049, now seen corresponding path program 8 times [2018-07-25 13:29:39,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:39,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:29:39,937 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:29:39,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:29:39,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:39,939 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 11 states. [2018-07-25 13:29:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,990 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-07-25 13:29:39,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:29:39,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-07-25 13:29:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,993 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:29:39,994 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:29:39,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:29:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:29:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:29:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-07-25 13:29:40,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 48 [2018-07-25 13:29:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,002 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-07-25 13:29:40,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:29:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-07-25 13:29:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:29:40,003 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:40,006 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:40,006 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1514578579, now seen corresponding path program 9 times [2018-07-25 13:29:40,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:29:40,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:40,086 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:29:40,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:29:40,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:29:40,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:40,088 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 12 states. [2018-07-25 13:29:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:40,134 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-07-25 13:29:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:29:40,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-07-25 13:29:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:40,135 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:29:40,136 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:29:40,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:29:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:29:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:29:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-07-25 13:29:40,149 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2018-07-25 13:29:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,150 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-07-25 13:29:40,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:29:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-07-25 13:29:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:29:40,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:40,151 INFO L354 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:40,151 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -416161171, now seen corresponding path program 10 times [2018-07-25 13:29:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-07-25 13:29:40,264 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:40,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:40,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:40,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:40,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:40,267 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-07-25 13:29:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:40,275 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-07-25 13:29:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:40,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-07-25 13:29:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:40,277 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:29:40,277 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:29:40,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:29:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:29:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:29:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:29:40,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-07-25 13:29:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,281 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:29:40,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:29:40,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:29:40,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:29:40,313 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2018-07-25 13:29:40,314 INFO L425 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: true [2018-07-25 13:29:40,314 INFO L418 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2018-07-25 13:29:40,314 INFO L425 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2018-07-25 13:29:40,314 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 124) the Hoare annotation is: true [2018-07-25 13:29:40,315 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 124) no Hoare annotation was computed. [2018-07-25 13:29:40,315 INFO L418 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2018-07-25 13:29:40,315 INFO L418 ceAbstractionStarter]: At program point L86(lines 86 97) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-07-25 13:29:40,316 INFO L418 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-07-25 13:29:40,316 INFO L425 ceAbstractionStarter]: At program point L47(lines 47 55) the Hoare annotation is: true [2018-07-25 13:29:40,316 INFO L418 ceAbstractionStarter]: At program point L105(lines 105 114) the Hoare annotation is: false [2018-07-25 13:29:40,316 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) the Hoare annotation is: false [2018-07-25 13:29:40,317 INFO L425 ceAbstractionStarter]: At program point L66(lines 66 78) the Hoare annotation is: true [2018-07-25 13:29:40,337 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:40 BoogieIcfgContainer [2018-07-25 13:29:40,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:40,339 INFO L168 Benchmark]: Toolchain (without parser) took 3944.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:40,341 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:40,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:40,343 INFO L168 Benchmark]: Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:40,344 INFO L168 Benchmark]: RCFGBuilder took 274.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:40,345 INFO L168 Benchmark]: TraceAbstraction took 3595.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:40,352 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 274.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3595.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: 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 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 453 SDtfs, 333 SDslu, 2262 SDs, 0 SdLazy, 2647 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 332 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 35 NumberOfFragments, 39 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 59045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 1340/2000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-40-379.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-40-379.csv Received shutdown request...