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/toy/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:51:28,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:51:28,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:51:28,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:51:28,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:51:28,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:51:28,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:51:28,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:51:28,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:51:28,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:51:28,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:51:28,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:51:28,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:51:28,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:51:28,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:51:28,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:51:28,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:51:28,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:51:28,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:51:28,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:51:28,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:51:28,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:51:28,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:51:28,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:51:28,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:51:28,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:51:28,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:51:28,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:51:28,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:51:28,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:51:28,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:51:28,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:51:28,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:51:28,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:51:28,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:51:28,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:51:28,659 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:51:28,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:51:28,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:51:28,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:51:28,675 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:51:28,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:51:28,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:51:28,675 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:51:28,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:51:28,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:51:28,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:51:28,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:51:28,744 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:51:28,744 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:51:28,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2018-07-23 13:51:28,746 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2018-07-23 13:51:28,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:51:28,807 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:51:28,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:51:28,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:51:28,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:51:28,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:51:28,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:51:28,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:51:28,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:51:28,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/1) ... [2018-07-23 13:51:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:51:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:51:29,088 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:51:29,089 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:51:29 BoogieIcfgContainer [2018-07-23 13:51:29,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:51:29,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:51:29,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:51:29,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:51:29,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:28" (1/2) ... [2018-07-23 13:51:29,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272a604a and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:51:29, skipping insertion in model container [2018-07-23 13:51:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:51:29" (2/2) ... [2018-07-23 13:51:29,102 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2018-07-23 13:51:29,113 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:51:29,121 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:51:29,170 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:51:29,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:51:29,171 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:51:29,171 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:51:29,171 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:51:29,172 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:51:29,172 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:51:29,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:51:29,172 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:51:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:51:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:51:29,201 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,203 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:51:29,203 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-07-23 13:51:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,284 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:51:29,287 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:51:29,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:51:29,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,290 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:51:29,290 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= i 0)] [2018-07-23 13:51:29,291 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:51:29,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:51:29,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:51:29,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:51:29,310 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:51:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,334 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:51:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:51:29,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:51:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,346 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:51:29,346 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:51:29,350 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:51:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:51:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:51:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:51:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:51:29,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:51:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,396 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:51:29,396 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:51:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:51:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:51:29,397 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,397 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:51:29,397 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-07-23 13:51:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,421 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-23 13:51:29,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:51:29,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,422 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:51:29,423 INFO L185 omatonBuilderFactory]: Interpolants [39#true, 40#false, 41#(<= i 0), 42#(<= i 1)] [2018-07-23 13:51:29,423 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-23 13:51:29,425 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:51:29,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:51:29,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:51:29,428 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 13:51:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,453 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:51:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:51:29,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:51:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,454 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:51:29,454 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:51:29,458 INFO L575 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-23 13:51:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:51:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:51:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:51:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:51:29,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:51:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,461 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:51:29,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:51:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:51:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:51:29,463 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,464 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:51:29,464 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-07-23 13:51:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,498 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-23 13:51:29,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:51:29,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,507 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:51:29,507 INFO L185 omatonBuilderFactory]: Interpolants [71#true, 72#false, 73#(<= i 0), 74#(<= i 1), 75#(<= i 2)] [2018-07-23 13:51:29,507 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-23 13:51:29,507 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:51:29,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:51:29,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:51:29,508 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 13:51:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,526 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:51:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:51:29,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:51:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,527 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:51:29,527 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:51:29,528 INFO L575 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-23 13:51:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:51:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:51:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:51:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:51:29,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:51:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:51:29,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:51:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:51:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:51:29,532 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,532 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:51:29,532 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-07-23 13:51:29,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,563 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:51:29,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:51:29,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,564 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:51:29,564 INFO L185 omatonBuilderFactory]: Interpolants [112#(<= i 2), 113#(<= i 3), 108#true, 109#false, 110#(<= i 0), 111#(<= i 1)] [2018-07-23 13:51:29,564 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:51:29,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:51:29,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:51:29,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:51:29,566 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:51:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,578 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:51:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:51:29,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:51:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,579 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:51:29,579 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:51:29,580 INFO L575 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-23 13:51:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:51:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:51:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:51:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:51:29,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:51:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,583 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:51:29,584 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:51:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:51:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:51:29,584 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,585 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:51:29,585 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-07-23 13:51:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,649 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-23 13:51:29,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:51:29,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,650 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:51:29,651 INFO L185 omatonBuilderFactory]: Interpolants [150#true, 151#false, 152#(<= i 0), 153#(<= i 1), 154#(<= i 2), 155#(<= i 3), 156#(<= i 4)] [2018-07-23 13:51:29,651 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-23 13:51:29,651 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:51:29,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:51:29,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:51:29,652 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:51:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,670 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:51:29,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:51:29,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:51:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,671 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:51:29,672 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:51:29,672 INFO L575 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-23 13:51:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:51:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:51:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:51:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:51:29,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:51:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:51:29,679 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:51:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:51:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:51:29,682 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,682 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:51:29,682 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-07-23 13:51:29,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,733 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-23 13:51:29,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:51:29,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,734 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:51:29,735 INFO L185 omatonBuilderFactory]: Interpolants [197#true, 198#false, 199#(<= i 0), 200#(<= i 1), 201#(<= i 2), 202#(<= i 3), 203#(<= i 4), 204#(<= i 5)] [2018-07-23 13:51:29,735 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-23 13:51:29,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:51:29,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:51:29,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:51:29,736 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:51:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,751 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:51:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:51:29,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:51:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,752 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:51:29,752 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:51:29,753 INFO L575 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-23 13:51:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:51:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:51:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:51:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:51:29,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:51:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,756 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:51:29,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:51:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:51:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:51:29,757 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,757 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:51:29,758 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-07-23 13:51:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,835 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-23 13:51:29,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:51:29,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,842 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:51:29,843 INFO L185 omatonBuilderFactory]: Interpolants [256#(<= i 5), 257#(<= i 6), 249#true, 250#false, 251#(<= i 0), 252#(<= i 1), 253#(<= i 2), 254#(<= i 3), 255#(<= i 4)] [2018-07-23 13:51:29,843 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-23 13:51:29,843 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:51:29,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:51:29,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:51:29,844 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:51:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,872 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:51:29,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:51:29,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:51:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,874 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:51:29,874 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:51:29,875 INFO L575 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-23 13:51:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:51:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:51:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:51:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:51:29,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:51:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,886 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:51:29,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:51:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:51:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:51:29,886 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,887 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:51:29,887 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-07-23 13:51:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,933 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-23 13:51:29,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:51:29,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,935 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:51:29,935 INFO L185 omatonBuilderFactory]: Interpolants [306#true, 307#false, 308#(<= i 0), 309#(<= i 1), 310#(<= i 2), 311#(<= i 3), 312#(<= i 4), 313#(<= i 5), 314#(<= i 6), 315#(<= i 7)] [2018-07-23 13:51:29,935 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-23 13:51:29,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:51:29,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:51:29,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:51:29,937 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 13:51:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:29,963 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:51:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:51:29,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:51:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:29,964 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:51:29,965 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:51:29,968 INFO L575 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-23 13:51:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:51:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:51:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:51:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:51:29,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:51:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:29,975 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:51:29,975 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:51:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:51:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:51:29,978 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:29,979 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:51:29,979 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-07-23 13:51:29,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:30,058 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-23 13:51:30,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:30,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:51:30,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:30,059 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:51:30,060 INFO L185 omatonBuilderFactory]: Interpolants [368#true, 369#false, 370#(<= i 0), 371#(<= i 1), 372#(<= i 2), 373#(<= i 3), 374#(<= i 4), 375#(<= i 5), 376#(<= i 6), 377#(<= i 7), 378#(<= i 8)] [2018-07-23 13:51:30,060 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-23 13:51:30,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:51:30,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:51:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:51:30,067 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 13:51:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:30,089 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:51:30,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:51:30,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:51:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:30,090 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:51:30,090 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:51:30,091 INFO L575 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-23 13:51:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:51:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:51:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:51:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:51:30,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:51:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:30,095 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:51:30,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:51:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:51:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:51:30,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:30,096 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:51:30,096 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:51:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-07-23 13:51:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:30,143 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:51:30,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-23 13:51:30,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:30,144 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:51:30,144 INFO L185 omatonBuilderFactory]: Interpolants [435#true, 436#false, 437#(<= 0 s), 438#(<= 1 s), 439#(<= 2 s), 440#(<= 3 s), 441#(<= 4 s), 442#(<= 5 s), 443#(<= 6 s), 444#(<= 7 s), 445#(<= 8 s), 446#(<= 9 s)] [2018-07-23 13:51:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:30,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:51:30,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:51:30,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:51:30,146 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 13:51:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:30,160 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:51:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:51:30,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:51:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:30,161 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:51:30,162 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:51:30,162 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-23 13:51:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:51:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:51:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:51:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:51:30,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-07-23 13:51:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:30,164 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:51:30,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:51:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:51:30,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:51:30,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:51:30,216 INFO L417 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (<= 9 s) [2018-07-23 13:51:30,216 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 22 30) the Hoare annotation is: true [2018-07-23 13:51:30,216 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 22 30) no Hoare annotation was computed. [2018-07-23 13:51:30,216 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 22 30) the Hoare annotation is: true [2018-07-23 13:51:30,217 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 29) the Hoare annotation is: false [2018-07-23 13:51:30,218 INFO L417 ceAbstractionStarter]: At program point L25(lines 25 28) the Hoare annotation is: (or (<= 9 s) (and (<= i 0) (<= 0 s)) (and (<= 4 s) (<= i 4)) (and (<= i 1) (<= 1 s)) (and (<= 8 s) (<= i 8)) (and (<= i 7) (<= 7 s)) (and (<= i 3) (<= 3 s)) (and (<= 5 s) (<= i 5)) (and (<= i 2) (<= 2 s)) (and (<= i 6) (<= 6 s))) [2018-07-23 13:51:30,231 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:51:30 BoogieIcfgContainer [2018-07-23 13:51:30,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:51:30,232 INFO L168 Benchmark]: Toolchain (without parser) took 1427.18 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:51:30,234 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.60 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:51:30,235 INFO L168 Benchmark]: Boogie Preprocessor took 58.08 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:51:30,236 INFO L168 Benchmark]: RCFGBuilder took 223.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:51:30,237 INFO L168 Benchmark]: TraceAbstraction took 1139.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-23 13:51:30,241 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.60 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 58.08 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 223.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1139.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((9 <= s || (i <= 0 && 0 <= s)) || (4 <= s && i <= 4)) || (i <= 1 && 1 <= s)) || (8 <= s && i <= 8)) || (i <= 7 && 7 <= s)) || (i <= 3 && 3 <= s)) || (5 <= s && i <= 5)) || (i <= 2 && 2 <= s)) || (i <= 6 && 6 <= s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 9 SDslu, 39 SDs, 0 SdLazy, 111 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 45/165 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 73 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 45/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-51-30-259.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-51-30-259.csv Received shutdown request...