java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:09:40,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:09:40,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:09:40,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:09:40,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:09:40,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:09:40,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:09:40,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:09:40,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:09:40,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:09:40,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:09:40,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:09:40,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:09:40,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:09:40,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:09:40,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:09:40,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:09:40,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:09:40,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:09:40,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:09:40,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:09:40,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:09:40,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:09:40,287 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:09:40,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:09:40,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:09:40,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:09:40,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:09:40,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:09:40,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:09:40,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:09:40,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:09:40,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:09:40,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:09:40,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:09:40,301 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:09:40,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:09:40,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:09:40,315 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:09:40,315 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:09:40,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:09:40,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:09:40,316 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:09:40,316 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:09:40,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:09:40,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:09:40,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:09:40,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:09:40,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:09:40,317 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:09:40,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:09:40,319 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:09:40,322 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:09:40,322 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:09:40,371 INFO ]: Repository-Root is: /tmp [2018-06-25 00:09:40,384 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:09:40,391 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:09:40,392 INFO ]: Initializing SmtParser... [2018-06-25 00:09:40,392 INFO ]: SmtParser initialized [2018-06-25 00:09:40,393 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 [2018-06-25 00:09:40,394 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 00:09:40,486 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 unknown [2018-06-25 00:09:41,051 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 [2018-06-25 00:09:41,056 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:09:41,061 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:09:41,061 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:09:41,062 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:09:41,062 INFO ]: ChcToBoogie initialized [2018-06-25 00:09:41,065 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,168 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41 Unit [2018-06-25 00:09:41,168 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:09:41,169 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:09:41,169 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:09:41,169 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:09:41,182 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,182 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,192 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,193 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,207 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,209 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,213 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,218 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:09:41,219 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:09:41,219 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:09:41,219 INFO ]: RCFGBuilder initialized [2018-06-25 00:09:41,220 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:09:41,242 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:09:41,242 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:09:41,242 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:09:41,242 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:09:41,242 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:09:41,242 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:09:41,666 INFO ]: Using library mode [2018-06-25 00:09:41,667 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:41 BoogieIcfgContainer [2018-06-25 00:09:41,667 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:09:41,667 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:09:41,667 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:09:41,668 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:09:41,668 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:41" (1/1) ... [2018-06-25 00:09:41,685 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:09:41,686 INFO ]: Using Remove infeasible edges [2018-06-25 00:09:41,687 INFO ]: Using Maximize final states [2018-06-25 00:09:41,687 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:09:41,687 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:09:41,690 INFO ]: Using Remove sink states [2018-06-25 00:09:41,691 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:09:41,691 INFO ]: Using Use SBE [2018-06-25 00:09:42,796 WARN ]: Simplifying disjunction of 6904 conjuctions. This might take some time... [2018-06-25 00:10:03,731 INFO ]: Simplified to disjunction of 6904 conjuctions. [2018-06-25 00:10:04,653 INFO ]: SBE split 1 edges [2018-06-25 00:10:04,747 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:10:04,750 INFO ]: 0 new accepting states [2018-06-25 00:10:04,803 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:10:04,805 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:10:04,941 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:10:04,943 INFO ]: 0 new accepting states [2018-06-25 00:10:04,944 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:10:04,944 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:10:05,103 INFO ]: Encoded RCFG 6 locations, 868 edges [2018-06-25 00:10:05,104 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:10:05 BasicIcfg [2018-06-25 00:10:05,104 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:10:05,106 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:10:05,106 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:10:05,109 INFO ]: TraceAbstraction initialized [2018-06-25 00:10:05,110 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:09:41" (1/4) ... [2018-06-25 00:10:05,112 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58278713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:10:05, skipping insertion in model container [2018-06-25 00:10:05,112 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:41" (2/4) ... [2018-06-25 00:10:05,112 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58278713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:10:05, skipping insertion in model container [2018-06-25 00:10:05,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:41" (3/4) ... [2018-06-25 00:10:05,113 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58278713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:10:05, skipping insertion in model container [2018-06-25 00:10:05,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:10:05" (4/4) ... [2018-06-25 00:10:05,114 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:10:05,124 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:10:05,132 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:10:05,197 INFO ]: Using default assertion order modulation [2018-06-25 00:10:05,198 INFO ]: Interprodecural is true [2018-06-25 00:10:05,198 INFO ]: Hoare is false [2018-06-25 00:10:05,198 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:10:05,198 INFO ]: Backedges is TWOTRACK [2018-06-25 00:10:05,198 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:10:05,198 INFO ]: Difference is false [2018-06-25 00:10:05,198 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:10:05,198 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:10:05,218 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:10:05,245 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:10:05,245 INFO ]: Found error trace [2018-06-25 00:10:05,246 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:10:05,246 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:05,252 INFO ]: Analyzing trace with hash 61941538, now seen corresponding path program 1 times [2018-06-25 00:10:05,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:05,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:05,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:05,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:05,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:05,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:05,492 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:10:05,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:05,494 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:05,495 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:05,506 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:05,507 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:05,510 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:10:10,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:10,954 INFO ]: Finished difference Result 7 states and 957 transitions. [2018-06-25 00:10:10,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:10,955 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:10:10,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:10,969 INFO ]: With dead ends: 7 [2018-06-25 00:10:10,969 INFO ]: Without dead ends: 7 [2018-06-25 00:10:10,971 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:10,990 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:10:11,029 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:10:11,030 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:10:11,033 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 957 transitions. [2018-06-25 00:10:11,034 INFO ]: Start accepts. Automaton has 7 states and 957 transitions. Word has length 5 [2018-06-25 00:10:11,035 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:11,035 INFO ]: Abstraction has 7 states and 957 transitions. [2018-06-25 00:10:11,035 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:11,035 INFO ]: Start isEmpty. Operand 7 states and 957 transitions. [2018-06-25 00:10:11,036 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:10:11,036 INFO ]: Found error trace [2018-06-25 00:10:11,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:10:11,036 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:11,036 INFO ]: Analyzing trace with hash 1913750098, now seen corresponding path program 1 times [2018-06-25 00:10:11,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:11,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:11,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:11,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:11,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:11,075 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:11,164 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:10:11,164 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:11,164 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:11,166 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:11,166 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:11,166 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:11,166 INFO ]: Start difference. First operand 7 states and 957 transitions. Second operand 3 states. [2018-06-25 00:10:13,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:13,768 INFO ]: Finished difference Result 8 states and 959 transitions. [2018-06-25 00:10:13,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:13,795 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:10:13,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:13,797 INFO ]: With dead ends: 8 [2018-06-25 00:10:13,797 INFO ]: Without dead ends: 8 [2018-06-25 00:10:13,798 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:13,798 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:10:13,806 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:10:13,806 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:10:13,810 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 959 transitions. [2018-06-25 00:10:13,810 INFO ]: Start accepts. Automaton has 8 states and 959 transitions. Word has length 6 [2018-06-25 00:10:13,810 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:13,810 INFO ]: Abstraction has 8 states and 959 transitions. [2018-06-25 00:10:13,810 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:13,810 INFO ]: Start isEmpty. Operand 8 states and 959 transitions. [2018-06-25 00:10:13,810 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:10:13,811 INFO ]: Found error trace [2018-06-25 00:10:13,811 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:10:13,811 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:13,811 INFO ]: Analyzing trace with hash 1920631819, now seen corresponding path program 1 times [2018-06-25 00:10:13,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:13,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:13,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:13,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:13,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:13,839 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:13,885 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:10:13,885 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:13,885 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:13,885 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:13,885 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:13,885 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:13,885 INFO ]: Start difference. First operand 8 states and 959 transitions. Second operand 3 states. [2018-06-25 00:10:16,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:16,750 INFO ]: Finished difference Result 9 states and 961 transitions. [2018-06-25 00:10:16,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:16,753 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:10:16,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:16,754 INFO ]: With dead ends: 9 [2018-06-25 00:10:16,754 INFO ]: Without dead ends: 9 [2018-06-25 00:10:16,755 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:16,755 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:10:16,760 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:10:16,760 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:10:16,762 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2018-06-25 00:10:16,762 INFO ]: Start accepts. Automaton has 9 states and 961 transitions. Word has length 6 [2018-06-25 00:10:16,762 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:16,762 INFO ]: Abstraction has 9 states and 961 transitions. [2018-06-25 00:10:16,762 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:16,762 INFO ]: Start isEmpty. Operand 9 states and 961 transitions. [2018-06-25 00:10:16,764 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:10:16,764 INFO ]: Found error trace [2018-06-25 00:10:16,764 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:16,764 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:16,764 INFO ]: Analyzing trace with hash -1113434203, now seen corresponding path program 1 times [2018-06-25 00:10:16,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:16,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:16,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:16,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:16,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:16,821 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:16,918 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:10:16,918 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:16,918 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:16,918 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:16,918 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:16,918 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:16,918 INFO ]: Start difference. First operand 9 states and 961 transitions. Second operand 3 states. [2018-06-25 00:10:19,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:19,541 INFO ]: Finished difference Result 11 states and 976 transitions. [2018-06-25 00:10:19,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:19,542 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:10:19,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:19,544 INFO ]: With dead ends: 11 [2018-06-25 00:10:19,544 INFO ]: Without dead ends: 11 [2018-06-25 00:10:19,544 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:19,544 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:10:19,550 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:10:19,550 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:10:19,552 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 976 transitions. [2018-06-25 00:10:19,552 INFO ]: Start accepts. Automaton has 11 states and 976 transitions. Word has length 8 [2018-06-25 00:10:19,552 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:19,552 INFO ]: Abstraction has 11 states and 976 transitions. [2018-06-25 00:10:19,552 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:19,552 INFO ]: Start isEmpty. Operand 11 states and 976 transitions. [2018-06-25 00:10:19,553 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:10:19,553 INFO ]: Found error trace [2018-06-25 00:10:19,553 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:19,553 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:19,553 INFO ]: Analyzing trace with hash -1841168751, now seen corresponding path program 1 times [2018-06-25 00:10:19,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:19,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:19,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:19,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:19,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:19,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:19,647 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:10:19,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:19,648 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:19,648 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:19,648 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:19,648 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:19,648 INFO ]: Start difference. First operand 11 states and 976 transitions. Second operand 3 states. [2018-06-25 00:10:21,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:21,798 INFO ]: Finished difference Result 13 states and 1028 transitions. [2018-06-25 00:10:21,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:21,801 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:10:21,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:21,803 INFO ]: With dead ends: 13 [2018-06-25 00:10:21,803 INFO ]: Without dead ends: 13 [2018-06-25 00:10:21,803 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:21,803 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:10:21,808 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:10:21,808 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:10:21,810 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1026 transitions. [2018-06-25 00:10:21,810 INFO ]: Start accepts. Automaton has 12 states and 1026 transitions. Word has length 8 [2018-06-25 00:10:21,810 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:21,810 INFO ]: Abstraction has 12 states and 1026 transitions. [2018-06-25 00:10:21,810 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:21,811 INFO ]: Start isEmpty. Operand 12 states and 1026 transitions. [2018-06-25 00:10:21,811 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:10:21,811 INFO ]: Found error trace [2018-06-25 00:10:21,811 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:21,811 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:21,812 INFO ]: Analyzing trace with hash -387575108, now seen corresponding path program 1 times [2018-06-25 00:10:21,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:21,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:21,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:21,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:21,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:21,864 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:21,969 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:10:21,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:21,969 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:21,969 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:21,969 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:21,970 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:21,970 INFO ]: Start difference. First operand 12 states and 1026 transitions. Second operand 3 states. [2018-06-25 00:10:24,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:24,098 INFO ]: Finished difference Result 14 states and 1158 transitions. [2018-06-25 00:10:24,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:24,128 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:10:24,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:24,130 INFO ]: With dead ends: 14 [2018-06-25 00:10:24,130 INFO ]: Without dead ends: 13 [2018-06-25 00:10:24,130 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:24,130 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:10:24,136 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:10:24,136 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:10:24,137 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1157 transitions. [2018-06-25 00:10:24,137 INFO ]: Start accepts. Automaton has 13 states and 1157 transitions. Word has length 9 [2018-06-25 00:10:24,138 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:24,138 INFO ]: Abstraction has 13 states and 1157 transitions. [2018-06-25 00:10:24,138 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:24,138 INFO ]: Start isEmpty. Operand 13 states and 1157 transitions. [2018-06-25 00:10:24,138 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:10:24,138 INFO ]: Found error trace [2018-06-25 00:10:24,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:24,139 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:24,139 INFO ]: Analyzing trace with hash -1705236908, now seen corresponding path program 1 times [2018-06-25 00:10:24,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:24,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:24,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:24,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:24,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:24,172 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:24,260 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:10:24,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:24,261 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:24,261 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:24,261 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:24,261 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:24,261 INFO ]: Start difference. First operand 13 states and 1157 transitions. Second operand 3 states. [2018-06-25 00:10:26,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:26,530 INFO ]: Finished difference Result 15 states and 1209 transitions. [2018-06-25 00:10:26,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:26,531 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:10:26,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:26,533 INFO ]: With dead ends: 15 [2018-06-25 00:10:26,533 INFO ]: Without dead ends: 15 [2018-06-25 00:10:26,533 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:26,533 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:10:26,543 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-25 00:10:26,543 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:10:26,544 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1157 transitions. [2018-06-25 00:10:26,544 INFO ]: Start accepts. Automaton has 13 states and 1157 transitions. Word has length 9 [2018-06-25 00:10:26,544 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:26,544 INFO ]: Abstraction has 13 states and 1157 transitions. [2018-06-25 00:10:26,545 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:26,545 INFO ]: Start isEmpty. Operand 13 states and 1157 transitions. [2018-06-25 00:10:26,545 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:10:26,545 INFO ]: Found error trace [2018-06-25 00:10:26,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:26,546 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:26,546 INFO ]: Analyzing trace with hash -1704313387, now seen corresponding path program 1 times [2018-06-25 00:10:26,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:26,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:26,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:26,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:26,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:26,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:26,666 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:10:26,666 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:26,666 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:26,666 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:26,666 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:26,666 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:26,667 INFO ]: Start difference. First operand 13 states and 1157 transitions. Second operand 3 states. [2018-06-25 00:10:29,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:29,413 INFO ]: Finished difference Result 15 states and 1245 transitions. [2018-06-25 00:10:29,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:29,486 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:10:29,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:29,488 INFO ]: With dead ends: 15 [2018-06-25 00:10:29,488 INFO ]: Without dead ends: 15 [2018-06-25 00:10:29,488 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:29,488 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:10:29,495 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-25 00:10:29,495 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:10:29,496 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1243 transitions. [2018-06-25 00:10:29,496 INFO ]: Start accepts. Automaton has 14 states and 1243 transitions. Word has length 9 [2018-06-25 00:10:29,497 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:29,497 INFO ]: Abstraction has 14 states and 1243 transitions. [2018-06-25 00:10:29,497 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:29,497 INFO ]: Start isEmpty. Operand 14 states and 1243 transitions. [2018-06-25 00:10:29,497 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:29,497 INFO ]: Found error trace [2018-06-25 00:10:29,498 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:29,498 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:29,498 INFO ]: Analyzing trace with hash 992005379, now seen corresponding path program 1 times [2018-06-25 00:10:29,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:29,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:29,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:29,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:29,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:29,530 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:29,637 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:10:29,637 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:29,637 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:29,638 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:29,638 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:29,638 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:29,638 INFO ]: Start difference. First operand 14 states and 1243 transitions. Second operand 3 states. [2018-06-25 00:10:32,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:32,009 INFO ]: Finished difference Result 21 states and 1255 transitions. [2018-06-25 00:10:32,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:32,009 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:32,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:32,011 INFO ]: With dead ends: 21 [2018-06-25 00:10:32,011 INFO ]: Without dead ends: 21 [2018-06-25 00:10:32,011 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:32,011 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:10:32,020 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 00:10:32,020 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:10:32,022 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1251 transitions. [2018-06-25 00:10:32,022 INFO ]: Start accepts. Automaton has 19 states and 1251 transitions. Word has length 10 [2018-06-25 00:10:32,022 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:32,022 INFO ]: Abstraction has 19 states and 1251 transitions. [2018-06-25 00:10:32,022 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:32,022 INFO ]: Start isEmpty. Operand 19 states and 1251 transitions. [2018-06-25 00:10:32,023 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:32,023 INFO ]: Found error trace [2018-06-25 00:10:32,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:32,023 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:32,023 INFO ]: Analyzing trace with hash 675895426, now seen corresponding path program 1 times [2018-06-25 00:10:32,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:32,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:32,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:32,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:32,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:32,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:32,151 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:32,151 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:32,151 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:32,152 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:32,152 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:32,152 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:32,152 INFO ]: Start difference. First operand 19 states and 1251 transitions. Second operand 3 states. [2018-06-25 00:10:34,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:34,239 INFO ]: Finished difference Result 23 states and 1463 transitions. [2018-06-25 00:10:34,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:34,240 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:34,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:34,242 INFO ]: With dead ends: 23 [2018-06-25 00:10:34,242 INFO ]: Without dead ends: 23 [2018-06-25 00:10:34,242 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:34,242 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:10:34,248 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-25 00:10:34,248 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 00:10:34,250 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1457 transitions. [2018-06-25 00:10:34,250 INFO ]: Start accepts. Automaton has 20 states and 1457 transitions. Word has length 10 [2018-06-25 00:10:34,250 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:34,250 INFO ]: Abstraction has 20 states and 1457 transitions. [2018-06-25 00:10:34,250 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:34,250 INFO ]: Start isEmpty. Operand 20 states and 1457 transitions. [2018-06-25 00:10:34,251 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:34,251 INFO ]: Found error trace [2018-06-25 00:10:34,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:34,251 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:34,251 INFO ]: Analyzing trace with hash 680513031, now seen corresponding path program 1 times [2018-06-25 00:10:34,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:34,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:34,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:34,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:34,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:34,280 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:34,373 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:34,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:34,374 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:34,374 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:34,374 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:34,374 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:34,374 INFO ]: Start difference. First operand 20 states and 1457 transitions. Second operand 3 states. [2018-06-25 00:10:36,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:36,690 INFO ]: Finished difference Result 24 states and 1485 transitions. [2018-06-25 00:10:36,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:36,690 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:36,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:36,692 INFO ]: With dead ends: 24 [2018-06-25 00:10:36,692 INFO ]: Without dead ends: 22 [2018-06-25 00:10:36,693 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:36,693 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:10:36,699 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-25 00:10:36,699 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 00:10:36,700 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1482 transitions. [2018-06-25 00:10:36,700 INFO ]: Start accepts. Automaton has 21 states and 1482 transitions. Word has length 10 [2018-06-25 00:10:36,700 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:36,701 INFO ]: Abstraction has 21 states and 1482 transitions. [2018-06-25 00:10:36,701 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:36,701 INFO ]: Start isEmpty. Operand 21 states and 1482 transitions. [2018-06-25 00:10:36,701 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:36,702 INFO ]: Found error trace [2018-06-25 00:10:36,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:36,702 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:36,702 INFO ]: Analyzing trace with hash 251999287, now seen corresponding path program 1 times [2018-06-25 00:10:36,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:36,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:36,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:36,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:36,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:36,747 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:36,841 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:36,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:36,841 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:36,841 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:36,841 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:36,841 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:36,841 INFO ]: Start difference. First operand 21 states and 1482 transitions. Second operand 3 states. [2018-06-25 00:10:39,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:39,020 INFO ]: Finished difference Result 25 states and 1770 transitions. [2018-06-25 00:10:39,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:39,021 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:39,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:39,023 INFO ]: With dead ends: 25 [2018-06-25 00:10:39,023 INFO ]: Without dead ends: 25 [2018-06-25 00:10:39,023 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:39,023 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 00:10:39,029 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-25 00:10:39,030 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 00:10:39,031 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1764 transitions. [2018-06-25 00:10:39,031 INFO ]: Start accepts. Automaton has 22 states and 1764 transitions. Word has length 10 [2018-06-25 00:10:39,031 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:39,031 INFO ]: Abstraction has 22 states and 1764 transitions. [2018-06-25 00:10:39,031 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:39,031 INFO ]: Start isEmpty. Operand 22 states and 1764 transitions. [2018-06-25 00:10:39,033 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:39,033 INFO ]: Found error trace [2018-06-25 00:10:39,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:39,033 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:39,033 INFO ]: Analyzing trace with hash -1341277438, now seen corresponding path program 1 times [2018-06-25 00:10:39,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:39,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:39,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:39,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:39,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:39,064 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:39,258 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-25 00:10:39,258 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:10:39,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:39,258 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:39,258 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:39,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:39,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:39,258 INFO ]: Start difference. First operand 22 states and 1764 transitions. Second operand 3 states. [2018-06-25 00:10:41,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:41,380 INFO ]: Finished difference Result 26 states and 1980 transitions. [2018-06-25 00:10:41,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:41,380 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:10:41,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:41,382 INFO ]: With dead ends: 26 [2018-06-25 00:10:41,382 INFO ]: Without dead ends: 26 [2018-06-25 00:10:41,382 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:41,382 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 00:10:41,392 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-25 00:10:41,392 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 00:10:41,401 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1974 transitions. [2018-06-25 00:10:41,401 INFO ]: Start accepts. Automaton has 23 states and 1974 transitions. Word has length 11 [2018-06-25 00:10:41,401 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:41,401 INFO ]: Abstraction has 23 states and 1974 transitions. [2018-06-25 00:10:41,401 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:41,401 INFO ]: Start isEmpty. Operand 23 states and 1974 transitions. [2018-06-25 00:10:41,402 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:41,402 INFO ]: Found error trace [2018-06-25 00:10:41,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:41,402 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:41,403 INFO ]: Analyzing trace with hash 1694390392, now seen corresponding path program 1 times [2018-06-25 00:10:41,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:41,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:41,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:41,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:41,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:41,434 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:41,522 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:41,522 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:41,522 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:41,522 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:41,522 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:41,522 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:41,522 INFO ]: Start difference. First operand 23 states and 1974 transitions. Second operand 3 states. [2018-06-25 00:10:43,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:43,888 INFO ]: Finished difference Result 39 states and 3368 transitions. [2018-06-25 00:10:43,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:43,889 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:10:43,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:43,893 INFO ]: With dead ends: 39 [2018-06-25 00:10:43,893 INFO ]: Without dead ends: 39 [2018-06-25 00:10:43,893 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:43,893 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 00:10:43,907 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-06-25 00:10:43,907 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 00:10:43,911 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3357 transitions. [2018-06-25 00:10:43,911 INFO ]: Start accepts. Automaton has 32 states and 3357 transitions. Word has length 11 [2018-06-25 00:10:43,911 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:43,911 INFO ]: Abstraction has 32 states and 3357 transitions. [2018-06-25 00:10:43,911 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:43,911 INFO ]: Start isEmpty. Operand 32 states and 3357 transitions. [2018-06-25 00:10:43,913 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:43,913 INFO ]: Found error trace [2018-06-25 00:10:43,913 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:43,913 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:43,913 INFO ]: Analyzing trace with hash 1579279142, now seen corresponding path program 1 times [2018-06-25 00:10:43,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:43,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:43,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:43,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:43,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:43,940 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:44,001 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:10:44,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:44,001 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:44,001 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:44,001 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:44,001 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:44,002 INFO ]: Start difference. First operand 32 states and 3357 transitions. Second operand 3 states. [2018-06-25 00:10:46,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:46,361 INFO ]: Finished difference Result 57 states and 5358 transitions. [2018-06-25 00:10:46,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:46,362 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:10:46,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:46,365 INFO ]: With dead ends: 57 [2018-06-25 00:10:46,365 INFO ]: Without dead ends: 57 [2018-06-25 00:10:46,365 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:46,365 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 00:10:46,379 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-06-25 00:10:46,379 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 00:10:46,386 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 5350 transitions. [2018-06-25 00:10:46,386 INFO ]: Start accepts. Automaton has 52 states and 5350 transitions. Word has length 11 [2018-06-25 00:10:46,387 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:46,387 INFO ]: Abstraction has 52 states and 5350 transitions. [2018-06-25 00:10:46,387 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:46,387 INFO ]: Start isEmpty. Operand 52 states and 5350 transitions. [2018-06-25 00:10:46,390 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:46,390 INFO ]: Found error trace [2018-06-25 00:10:46,390 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:46,390 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:46,390 INFO ]: Analyzing trace with hash 1817547560, now seen corresponding path program 1 times [2018-06-25 00:10:46,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:46,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:46,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:46,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:46,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:46,417 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:46,496 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:10:46,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:46,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:46,496 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:46,497 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:46,497 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:46,497 INFO ]: Start difference. First operand 52 states and 5350 transitions. Second operand 3 states. [2018-06-25 00:10:48,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:48,922 INFO ]: Finished difference Result 97 states and 8916 transitions. [2018-06-25 00:10:48,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:48,941 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:10:48,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:48,949 INFO ]: With dead ends: 97 [2018-06-25 00:10:48,949 INFO ]: Without dead ends: 97 [2018-06-25 00:10:48,949 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06-25 00:10:48,949 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-25 00:10:48,973 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-06-25 00:10:48,973 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 00:10:48,984 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 8908 transitions. [2018-06-25 00:10:48,984 INFO ]: Start accepts. Automaton has 92 states and 8908 transitions. Word has length 11 [2018-06-25 00:10:48,985 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:48,985 INFO ]: Abstraction has 92 states and 8908 transitions. [2018-06-25 00:10:48,985 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:48,985 INFO ]: Start isEmpty. Operand 92 states and 8908 transitions. [2018-06-25 00:10:48,987 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:48,987 INFO ]: Found error trace [2018-06-25 00:10:48,987 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:48,987 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:48,987 INFO ]: Analyzing trace with hash 1467798872, now seen corresponding path program 1 times [2018-06-25 00:10:48,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:48,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:48,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:48,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:48,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:49,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:49,099 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:49,099 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:49,099 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:49,099 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:49,099 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:49,099 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:49,099 INFO ]: Start difference. First operand 92 states and 8908 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:10:51,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:51,452 WARN ]: Verification canceled [2018-06-25 00:10:51,454 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:10:51,455 WARN ]: Timeout [2018-06-25 00:10:51,455 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:10:51 BasicIcfg [2018-06-25 00:10:51,455 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:10:51,457 INFO ]: Toolchain (without parser) took 70400.71 ms. Allocated memory was 309.9 MB in the beginning and 1.1 GB in the end (delta: 813.2 MB). Free memory was 244.3 MB in the beginning and 349.4 MB in the end (delta: -105.1 MB). Peak memory consumption was 708.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,457 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:10:51,458 INFO ]: ChcToBoogie took 106.82 ms. Allocated memory is still 309.9 MB. Free memory was 242.3 MB in the beginning and 240.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,458 INFO ]: Boogie Preprocessor took 49.87 ms. Allocated memory is still 309.9 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,459 INFO ]: RCFGBuilder took 448.11 ms. Allocated memory is still 309.9 MB. Free memory was 238.3 MB in the beginning and 206.4 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,459 INFO ]: BlockEncodingV2 took 23436.80 ms. Allocated memory was 309.9 MB in the beginning and 393.7 MB in the end (delta: 83.9 MB). Free memory was 206.4 MB in the beginning and 178.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,459 INFO ]: TraceAbstraction took 46349.21 ms. Allocated memory was 393.7 MB in the beginning and 1.1 GB in the end (delta: 729.3 MB). Free memory was 178.3 MB in the beginning and 349.4 MB in the end (delta: -171.1 MB). Peak memory consumption was 558.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:51,462 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 868 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 106.82 ms. Allocated memory is still 309.9 MB. Free memory was 242.3 MB in the beginning and 240.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.87 ms. Allocated memory is still 309.9 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 448.11 ms. Allocated memory is still 309.9 MB. Free memory was 238.3 MB in the beginning and 206.4 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 23436.80 ms. Allocated memory was 309.9 MB in the beginning and 393.7 MB in the end (delta: 83.9 MB). Free memory was 206.4 MB in the beginning and 178.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46349.21 ms. Allocated memory was 393.7 MB in the beginning and 1.1 GB in the end (delta: 729.3 MB). Free memory was 178.3 MB in the beginning and 349.4 MB in the end (delta: -171.1 MB). Peak memory consumption was 558.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (87 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 46.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 43.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 0 SDslu, 62 SDs, 0 SdLazy, 13723 SolverSat, 10487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 33 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 209/209 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-10-51-473.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-10-51-473.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-10-51-473.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-10-51-473.csv Completed graceful shutdown