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/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:20:05,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:20:05,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:20:05,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:20:05,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:20:05,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:20:05,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:20:05,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:20:05,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:20:05,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:20:05,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:20:05,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:20:05,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:20:05,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:20:05,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:20:05,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:20:05,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:20:05,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:20:05,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:20:05,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:20:05,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:20:05,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:20:05,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:20:05,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:20:05,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:20:05,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:20:05,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:20:05,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:20:05,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:20:05,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:20:05,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:20:05,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:20:05,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:20:05,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:20:05,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:20:05,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:20:05,775 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:20:05,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:20:05,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:20:05,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:20:05,794 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:20:05,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:20:05,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:20:05,795 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:20:05,795 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:20:05,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:20:05,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:20:05,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:20:05,900 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:20:05,901 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:20:05,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-07-25 13:20:05,902 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-07-25 13:20:05,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:20:05,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:20:05,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:20:05,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:20:05,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:20:05,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:05,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:20:06,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:20:06,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:20:06,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:20:06,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:20:06,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:20:06,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:20:06,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:20:06,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/1) ... [2018-07-25 13:20:06,120 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 13:20:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:20:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:20:06,292 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:20:06,293 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:20:06 BoogieIcfgContainer [2018-07-25 13:20:06,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:20:06,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:20:06,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:20:06,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:20:06,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:20:05" (1/2) ... [2018-07-25 13:20:06,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dcaa8c and model type interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:20:06, skipping insertion in model container [2018-07-25 13:20:06,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:20:06" (2/2) ... [2018-07-25 13:20:06,304 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-07-25 13:20:06,317 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:20:06,327 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:20:06,379 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:20:06,380 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:20:06,380 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:20:06,380 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:20:06,381 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:20:06,381 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:20:06,381 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:20:06,381 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:20:06,381 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:20:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:20:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:20:06,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,415 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:20:06,417 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-07-25 13:20:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,531 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:20:06,534 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:20:06,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:20:06,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:20:06,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:20:06,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:20:06,563 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 13:20:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,592 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-25 13:20:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:20:06,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:20:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,606 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:20:06,607 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:20:06,613 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:20:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:20:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:20:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:20:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:20:06,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:20:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,654 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:20:06,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:20:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:20:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:20:06,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,655 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:20:06,655 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-07-25 13:20:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:20:06,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:20:06,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:20:06,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:20:06,693 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:20:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,717 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:20:06,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:20:06,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:20:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,721 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:20:06,721 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:20:06,722 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:20:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:20:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:20:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:20:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:20:06,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:20:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,729 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:20:06,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:20:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:20:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:20:06,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,730 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:20:06,730 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-07-25 13:20:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:20:06,763 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:20:06,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:20:06,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:20:06,764 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:20:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,783 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:20:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:20:06,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:20:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,785 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:20:06,785 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:20:06,786 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:20:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:20:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:20:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:20:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:20:06,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:20:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,789 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:20:06,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:20:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:20:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:20:06,790 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,790 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:20:06,791 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-07-25 13:20:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,825 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:20:06,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:20:06,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:20:06,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:20:06,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:20:06,828 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:20:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,847 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:20:06,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:20:06,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:20:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,851 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:20:06,851 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:20:06,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:20:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:20:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:20:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:20:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:20:06,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:20:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,860 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:20:06,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:20:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:20:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:20:06,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,862 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:20:06,862 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-07-25 13:20:06,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:20:06,937 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:20:06,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:20:06,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:20:06,938 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:20:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,957 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:20:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:20:06,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:20:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,958 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:20:06,959 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:20:06,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:20:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:20:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:20:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:20:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:20:06,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:20:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,963 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:20:06,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:20:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:20:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:20:06,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,964 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:20:06,965 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-07-25 13:20:06,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:20:07,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:20:07,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:20:07,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:20:07,012 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:20:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,033 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:20:07,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:20:07,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:20:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,036 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:20:07,038 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:20:07,039 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:20:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:20:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:20:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:20:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:20:07,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:20:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,048 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:20:07,048 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:20:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:20:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:20:07,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,052 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:20:07,052 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-07-25 13:20:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:20:07,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:20:07,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:20:07,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:20:07,117 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:20:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,142 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:20:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:20:07,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:20:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,143 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:20:07,144 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:20:07,144 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:20:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:20:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:20:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:20:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:20:07,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:20:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,148 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:20:07,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:20:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:20:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:20:07,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,149 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:20:07,150 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-07-25 13:20:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:20:07,206 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:20:07,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:20:07,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:20:07,206 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:20:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,224 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:20:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:20:07,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:20:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,225 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:20:07,225 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:20:07,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:20:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:20:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:20:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:20:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:20:07,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:20:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,230 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:20:07,230 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:20:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:20:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:20:07,231 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,231 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:20:07,231 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-07-25 13:20:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:20:07,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:20:07,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:20:07,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:20:07,304 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:20:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,346 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:20:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:20:07,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:20:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,350 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:20:07,350 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:20:07,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:20:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:20:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:20:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:20:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:20:07,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:20:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,364 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:20:07,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:20:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:20:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:20:07,365 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,365 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:20:07,365 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,365 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-07-25 13:20:07,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:20:07,446 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:20:07,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:20:07,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:20:07,447 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:20:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,473 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:20:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:20:07,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:20:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,474 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:20:07,474 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:20:07,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:20:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:20:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:20:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:20:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:20:07,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:20:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,480 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:20:07,481 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:20:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:20:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:20:07,484 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,484 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:20:07,484 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-07-25 13:20:07,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:20:07,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:20:07,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:20:07,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:20:07,556 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:20:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,577 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:20:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:20:07,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:20:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,578 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:20:07,578 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:20:07,579 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:20:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:20:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:20:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:20:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:20:07,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:20:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,590 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:20:07,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:20:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:20:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:20:07,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,591 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:20:07,592 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-07-25 13:20:07,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,662 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,662 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:20:07,663 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:20:07,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:20:07,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:20:07,670 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:20:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,695 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:20:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:20:07,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:20:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,697 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:20:07,697 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:20:07,697 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:20:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:20:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:20:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:20:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:20:07,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:20:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,704 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:20:07,704 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:20:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:20:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:20:07,705 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,705 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:20:07,706 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-07-25 13:20:07,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:20:07,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:20:07,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:20:07,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:20:07,756 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:20:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,769 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:20:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:20:07,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:20:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,771 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:20:07,771 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:20:07,772 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:20:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:20:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:20:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:20:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:20:07,779 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:20:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,779 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:20:07,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:20:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:20:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:20:07,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,780 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:20:07,781 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-07-25 13:20:07,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:20:07,870 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:20:07,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:20:07,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:20:07,875 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:20:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,905 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:20:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:20:07,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:20:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,906 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:20:07,907 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:20:07,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:20:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:20:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:20:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:20:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:20:07,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:20:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,915 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:20:07,915 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:20:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:20:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:20:07,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,916 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:20:07,916 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-07-25 13:20:07,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:20:07,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:20:07,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:20:07,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:20:07,989 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:20:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:08,014 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:20:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:20:08,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:20:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:08,016 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:20:08,016 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:20:08,016 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:20:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:20:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:20:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:20:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:20:08,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:20:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:08,026 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:20:08,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:20:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:20:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:20:08,027 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:08,027 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:20:08,029 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-07-25 13:20:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:08,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:08,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:20:08,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:20:08,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:20:08,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:20:08,115 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:20:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:08,143 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:20:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:20:08,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:20:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:08,145 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:20:08,145 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:20:08,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:20:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:20:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:20:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:20:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:20:08,155 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:20:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:08,155 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:20:08,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:20:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:20:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:20:08,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:08,157 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:20:08,158 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-07-25 13:20:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:20:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:20:08,197 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 13:20:08,239 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:20:08 BoogieIcfgContainer [2018-07-25 13:20:08,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:20:08,241 INFO L168 Benchmark]: Toolchain (without parser) took 2281.74 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: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:08,243 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:20:08,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.34 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:20:08,246 INFO L168 Benchmark]: Boogie Preprocessor took 25.45 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:20:08,247 INFO L168 Benchmark]: RCFGBuilder took 262.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:20:08,248 INFO L168 Benchmark]: TraceAbstraction took 1944.97 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: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:08,256 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.19 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 43.34 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 25.45 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 262.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1944.97 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: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: assertion can be violated assertion can be violated We found a FailurePath: [L18] havoc main_#res; [L19] havoc main_#t~nondet0, main_~yy~5, main_~z~5, main_#t~nondet1, main_~xx~5, main_~x~5, main_~y~5, main_~zz~5, main_~i~5; [L20] main_~x~5 := main_#t~nondet0; [L21] havoc main_#t~nondet0; [L22] main_~y~5 := main_#t~nondet1; [L23] havoc main_#t~nondet1; [L24] havoc main_~xx~5; [L25] havoc main_~yy~5; [L26] havoc main_~zz~5; [L27] main_~z~5 := 0; [L28] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L35] assume main_~i~5 < 4294967296 && !(main_~i~5 < 16); [L36] assume main_~x~5 < -65536; [L37] main_~xx~5 := main_~x~5 % 65536; [L38] assume main_~y~5 < -65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] havoc main_~xx~5; [L41] havoc main_~xx~5; [L42] havoc main_~xx~5; [L43] havoc main_~xx~5; [L44] havoc main_~yy~5; [L45] havoc main_~yy~5; [L46] havoc main_~yy~5; [L47] havoc main_~yy~5; [L48] havoc main_~zz~5; [L49] assume (((main_~zz~5 < 4294967296 && 0 <= main_~zz~5) && -4294967296 <= main_~z~5) && main_~z~5 < 0) && !(main_~z~5 + 4294967296 == main_~zz~5); [L50] __VERIFIER_assert_#in~cond := 0; [L51] havoc __VERIFIER_assert_~cond; [L52] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L53] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 1.8s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 117 SDs, 0 SdLazy, 269 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-20-08-278.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-20-08-278.csv Received shutdown request...