java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:47:01,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:47:01,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:47:01,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:47:01,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:47:01,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:47:01,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:47:01,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:47:01,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:47:01,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:47:01,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:47:01,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:47:01,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:47:01,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:47:01,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:47:01,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:47:01,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:47:01,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:47:01,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:47:01,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:47:01,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:47:01,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:47:01,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:47:01,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:47:01,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:47:01,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:47:01,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:47:01,627 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:47:01,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:47:01,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:47:01,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:47:01,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:47:01,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:47:01,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:47:01,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:47:01,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:47:01,633 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:47:01,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:47:01,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:47:01,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:47:01,662 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:47:01,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:47:01,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:47:01,663 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:47:01,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:47:01,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:47:01,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:47:01,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:47:01,736 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:47:01,736 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:47:01,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl [2018-07-23 13:47:01,737 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2018-07-23 13:47:01,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:47:01,795 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:47:01,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:47:01,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:47:01,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:47:01,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:47:01,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:47:01,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:47:01,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:47:01,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/1) ... [2018-07-23 13:47:01,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:47:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:47:02,114 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:47:02,115 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:02 BoogieIcfgContainer [2018-07-23 13:47:02,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:47:02,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:47:02,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:47:02,120 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:47:02,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:01" (1/2) ... [2018-07-23 13:47:02,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599f565b and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:47:02, skipping insertion in model container [2018-07-23 13:47:02,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:02" (2/2) ... [2018-07-23 13:47:02,125 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bpl [2018-07-23 13:47:02,136 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:47:02,145 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:47:02,198 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:47:02,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:47:02,199 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:47:02,200 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:47:02,200 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:47:02,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:47:02,200 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:47:02,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:47:02,201 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:47:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:47:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:47:02,235 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:02,237 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:47:02,237 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:47:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:02,337 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-23 13:47:02,340 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:47:02,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:47:02,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:02,343 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-23 13:47:02,343 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))] [2018-07-23 13:47:02,343 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-23 13:47:02,345 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:47:02,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:47:02,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:47:02,360 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:47:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:02,398 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 13:47:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:47:02,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:47:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:02,411 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:47:02,412 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:47:02,415 INFO L575 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-23 13:47:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:47:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:47:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:47:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:47:02,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:47:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:47:02,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:47:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:47:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:47:02,455 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:02,455 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:47:02,456 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 13:47:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:02,496 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-23 13:47:02,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:02,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:47:02,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:02,497 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-23 13:47:02,497 INFO L185 omatonBuilderFactory]: Interpolants [48#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)), 49#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)), 46#true, 47#false] [2018-07-23 13:47:02,498 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-23 13:47:02,500 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:47:02,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:47:02,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:47:02,501 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:47:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:02,527 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:47:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:47:02,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:47:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:02,529 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:47:02,529 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:47:02,530 INFO L575 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-23 13:47:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:47:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:47:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:47:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:47:02,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:47:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:47:02,538 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:47:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:47:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:47:02,538 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:02,538 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:47:02,539 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 13:47:02,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:02,593 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-23 13:47:02,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:02,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:47:02,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:02,594 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-23 13:47:02,594 INFO L185 omatonBuilderFactory]: Interpolants [90#true, 91#false, 92#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)), 93#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)), 94#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))] [2018-07-23 13:47:02,595 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-23 13:47:02,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:47:02,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:47:02,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:02,596 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 13:47:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:02,637 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:47:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:47:02,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:47:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:02,638 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:47:02,639 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:47:02,642 INFO L575 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-23 13:47:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:47:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:47:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:47:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:47:02,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:47:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:02,652 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:47:02,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:47:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:47:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:47:02,654 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:02,654 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:47:02,654 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 13:47:02,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:02,760 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-23 13:47:02,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:02,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:47:02,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:02,761 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-23 13:47:02,761 INFO L185 omatonBuilderFactory]: Interpolants [144#false, 145#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)), 146#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)), 147#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)), 148#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)), 143#true] [2018-07-23 13:47:02,762 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-23 13:47:02,762 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:47:02,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:47:02,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:47:02,763 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 13:47:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:02,835 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:47:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:47:02,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:47:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:02,838 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:47:02,838 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:47:02,839 INFO L575 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-23 13:47:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:47:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:47:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:47:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:47:02,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:47:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:02,854 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:47:02,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:47:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:47:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:47:02,855 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:02,855 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:47:02,858 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 13:47:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:02,981 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-23 13:47:02,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:02,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:47:02,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:02,984 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-23 13:47:02,984 INFO L185 omatonBuilderFactory]: Interpolants [208#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)), 209#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)), 210#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)), 211#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4)), 205#true, 206#false, 207#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))] [2018-07-23 13:47:02,985 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-23 13:47:02,985 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:47:02,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:47:02,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:02,986 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 13:47:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:03,046 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-07-23 13:47:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:47:03,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:47:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:03,049 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:47:03,049 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:47:03,052 INFO L575 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-23 13:47:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:47:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:47:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:47:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:47:03,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-07-23 13:47:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:47:03,054 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:47:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:47:03,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:47:03,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:47:03,122 INFO L417 ceAbstractionStarter]: At program point L40(lines 17 40) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)) (and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)) (and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)) (and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))) [2018-07-23 13:47:03,125 INFO L417 ceAbstractionStarter]: At program point L20(lines 20 32) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)) (and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)) (and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)) (and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))) [2018-07-23 13:47:03,126 INFO L417 ceAbstractionStarter]: At program point L31(lines 31 41) the Hoare annotation is: false [2018-07-23 13:47:03,126 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 42) the Hoare annotation is: false [2018-07-23 13:47:03,126 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 43) the Hoare annotation is: true [2018-07-23 13:47:03,127 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-07-23 13:47:03,127 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 43) the Hoare annotation is: false [2018-07-23 13:47:03,140 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:47:03 BoogieIcfgContainer [2018-07-23 13:47:03,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:47:03,142 INFO L168 Benchmark]: Toolchain (without parser) took 1348.27 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-07-23 13:47:03,144 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-23 13:47:03,147 INFO L168 Benchmark]: Boogie Preprocessor took 55.71 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-23 13:47:03,147 INFO L168 Benchmark]: RCFGBuilder took 263.08 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-23 13:47:03,149 INFO L168 Benchmark]: TraceAbstraction took 1024.71 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:47:03,153 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.15 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 55.71 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 263.08 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 1024.71 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: 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: 17]: Loop Invariant Derived loop invariant: ((((main_~len~5 <= 0 && 0 <= main_~len~5) || (1 <= main_~len~5 && main_~len~5 <= 1)) || (main_~len~5 <= 3 && 3 <= main_~len~5)) || (main_~len~5 <= 2 && 2 <= main_~len~5)) || (4 <= main_~len~5 && main_~len~5 <= 4) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((main_~len~5 <= 0 && 0 <= main_~len~5) || (1 <= main_~len~5 && main_~len~5 <= 1)) || (main_~len~5 <= 2 && 2 <= main_~len~5)) || (main_~len~5 <= 3 && 3 <= main_~len~5)) || (4 <= main_~len~5 && main_~len~5 <= 4) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 0 SDslu, 51 SDs, 0 SdLazy, 74 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/40 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 76 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/40 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/n.c11.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-47-03-173.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/n.c11.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-47-03-173.csv Received shutdown request...