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/hopv/lia/mochi/kmp.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:21:07,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:21:07,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:21:07,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:21:07,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:21:07,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:21:07,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:21:07,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:21:07,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:21:07,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:21:07,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:21:07,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:21:07,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:21:07,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:21:07,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:21:07,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:21:07,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:21:07,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:21:07,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:21:07,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:21:07,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:21:07,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:21:07,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:21:07,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:21:07,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:21:07,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:21:07,256 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:21:07,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:21:07,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:21:07,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:21:07,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:21:07,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:21:07,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:21:07,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:21:07,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:21:07,261 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:21:07,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:21:07,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:21:07,275 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:21:07,276 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:21:07,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:21:07,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:21:07,277 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:21:07,277 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:21:07,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:21:07,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:21:07,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:21:07,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:21:07,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:21:07,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:21:07,278 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:21:07,279 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:21:07,281 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:21:07,281 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:21:07,327 INFO ]: Repository-Root is: /tmp [2018-06-24 21:21:07,347 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:21:07,354 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:21:07,356 INFO ]: Initializing SmtParser... [2018-06-24 21:21:07,356 INFO ]: SmtParser initialized [2018-06-24 21:21:07,357 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/kmp.smt2 [2018-06-24 21:21:07,358 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-24 21:21:07,446 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/kmp.smt2 unknown [2018-06-24 21:21:08,325 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/kmp.smt2 [2018-06-24 21:21:08,330 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:21:08,335 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:21:08,336 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:21:08,336 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:21:08,336 INFO ]: ChcToBoogie initialized [2018-06-24 21:21:08,339 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08 Unit [2018-06-24 21:21:08,442 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:21:08,443 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:21:08,443 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:21:08,443 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:21:08,457 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,457 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,471 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,471 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,497 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,503 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,508 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (1/1) ... [2018-06-24 21:21:08,514 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:21:08,515 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:21:08,515 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:21:08,515 INFO ]: RCFGBuilder initialized [2018-06-24 21:21:08,516 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (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-24 21:21:08,537 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:21:08,537 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:21:08,537 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:21:08,537 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:21:08,537 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:21:08,537 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-24 21:21:11,639 INFO ]: Using library mode [2018-06-24 21:21:11,640 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:11 BoogieIcfgContainer [2018-06-24 21:21:11,640 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:21:11,641 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:21:11,641 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:21:11,642 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:21:11,642 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:11" (1/1) ... [2018-06-24 21:21:11,693 INFO ]: Initial Icfg 262 locations, 463 edges [2018-06-24 21:21:11,695 INFO ]: Using Remove infeasible edges [2018-06-24 21:21:11,695 INFO ]: Using Maximize final states [2018-06-24 21:21:11,695 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:21:11,696 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:21:11,700 INFO ]: Using Remove sink states [2018-06-24 21:21:11,701 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:21:11,701 INFO ]: Using Use SBE [2018-06-24 21:21:11,809 INFO ]: SBE split 1 edges [2018-06-24 21:21:11,815 INFO ]: Removed 6 edges and 2 locations because of local infeasibility [2018-06-24 21:21:11,822 INFO ]: 0 new accepting states [2018-06-24 21:21:13,027 INFO ]: Removed 261 edges and 53 locations by large block encoding [2018-06-24 21:21:13,030 INFO ]: Removed 5 edges and 5 locations by removing sink states [2018-06-24 21:21:13,033 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:21:13,034 INFO ]: 0 new accepting states [2018-06-24 21:21:13,036 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:21:13,036 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:21:13,040 INFO ]: Encoded RCFG 202 locations, 404 edges [2018-06-24 21:21:13,040 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:21:13 BasicIcfg [2018-06-24 21:21:13,040 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:21:13,042 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:21:13,042 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:21:13,045 INFO ]: TraceAbstraction initialized [2018-06-24 21:21:13,045 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:21:08" (1/4) ... [2018-06-24 21:21:13,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc1a04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:21:13, skipping insertion in model container [2018-06-24 21:21:13,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:08" (2/4) ... [2018-06-24 21:21:13,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc1a04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:21:13, skipping insertion in model container [2018-06-24 21:21:13,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:11" (3/4) ... [2018-06-24 21:21:13,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc1a04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:21:13, skipping insertion in model container [2018-06-24 21:21:13,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:21:13" (4/4) ... [2018-06-24 21:21:13,048 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:21:13,056 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:21:13,062 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:21:13,103 INFO ]: Using default assertion order modulation [2018-06-24 21:21:13,103 INFO ]: Interprodecural is true [2018-06-24 21:21:13,103 INFO ]: Hoare is false [2018-06-24 21:21:13,104 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:21:13,104 INFO ]: Backedges is TWOTRACK [2018-06-24 21:21:13,104 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:21:13,104 INFO ]: Difference is false [2018-06-24 21:21:13,104 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:21:13,104 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:21:13,118 INFO ]: Start isEmpty. Operand 202 states. [2018-06-24 21:21:13,179 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:21:13,179 INFO ]: Found error trace [2018-06-24 21:21:13,180 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:21:13,180 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:13,185 INFO ]: Analyzing trace with hash 5097201, now seen corresponding path program 1 times [2018-06-24 21:21:13,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:13,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:13,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:13,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:13,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:13,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:13,387 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:21:13,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:13,389 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:13,390 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:13,400 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:13,400 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:13,403 INFO ]: Start difference. First operand 202 states. Second operand 3 states. [2018-06-24 21:21:14,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:14,998 INFO ]: Finished difference Result 306 states and 603 transitions. [2018-06-24 21:21:14,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:14,999 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:21:14,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:15,048 INFO ]: With dead ends: 306 [2018-06-24 21:21:15,048 INFO ]: Without dead ends: 302 [2018-06-24 21:21:15,050 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-24 21:21:15,071 INFO ]: Start minimizeSevpa. Operand 302 states. [2018-06-24 21:21:15,252 INFO ]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-06-24 21:21:15,253 INFO ]: Start removeUnreachable. Operand 302 states. [2018-06-24 21:21:15,280 INFO ]: Finished removeUnreachable. Reduced from 302 states to 302 states and 594 transitions. [2018-06-24 21:21:15,282 INFO ]: Start accepts. Automaton has 302 states and 594 transitions. Word has length 4 [2018-06-24 21:21:15,283 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:15,283 INFO ]: Abstraction has 302 states and 594 transitions. [2018-06-24 21:21:15,283 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:15,283 INFO ]: Start isEmpty. Operand 302 states and 594 transitions. [2018-06-24 21:21:15,305 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:21:15,305 INFO ]: Found error trace [2018-06-24 21:21:15,305 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:21:15,305 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:15,305 INFO ]: Analyzing trace with hash 162748290, now seen corresponding path program 1 times [2018-06-24 21:21:15,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:15,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:15,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:15,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:15,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:15,316 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:15,386 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:21:15,387 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:15,387 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:15,388 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:15,388 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:15,388 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:15,388 INFO ]: Start difference. First operand 302 states and 594 transitions. Second operand 3 states. [2018-06-24 21:21:17,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:17,159 INFO ]: Finished difference Result 404 states and 814 transitions. [2018-06-24 21:21:17,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:17,159 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:21:17,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:17,180 INFO ]: With dead ends: 404 [2018-06-24 21:21:17,180 INFO ]: Without dead ends: 404 [2018-06-24 21:21:17,180 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-24 21:21:17,181 INFO ]: Start minimizeSevpa. Operand 404 states. [2018-06-24 21:21:17,250 INFO ]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-06-24 21:21:17,251 INFO ]: Start removeUnreachable. Operand 404 states. [2018-06-24 21:21:17,265 INFO ]: Finished removeUnreachable. Reduced from 404 states to 404 states and 814 transitions. [2018-06-24 21:21:17,265 INFO ]: Start accepts. Automaton has 404 states and 814 transitions. Word has length 5 [2018-06-24 21:21:17,265 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:17,265 INFO ]: Abstraction has 404 states and 814 transitions. [2018-06-24 21:21:17,265 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:17,266 INFO ]: Start isEmpty. Operand 404 states and 814 transitions. [2018-06-24 21:21:17,273 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:21:17,273 INFO ]: Found error trace [2018-06-24 21:21:17,273 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:21:17,273 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:17,273 INFO ]: Analyzing trace with hash 162903011, now seen corresponding path program 1 times [2018-06-24 21:21:17,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:17,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:17,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:17,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:17,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:17,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:17,350 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:21:17,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:17,350 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:17,350 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:17,350 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:17,350 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:17,350 INFO ]: Start difference. First operand 404 states and 814 transitions. Second operand 3 states. [2018-06-24 21:21:18,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:18,282 INFO ]: Finished difference Result 506 states and 1039 transitions. [2018-06-24 21:21:18,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:18,282 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:21:18,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:18,310 INFO ]: With dead ends: 506 [2018-06-24 21:21:18,310 INFO ]: Without dead ends: 506 [2018-06-24 21:21:18,310 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-24 21:21:18,311 INFO ]: Start minimizeSevpa. Operand 506 states. [2018-06-24 21:21:18,387 INFO ]: Finished minimizeSevpa. Reduced states from 506 to 506. [2018-06-24 21:21:18,387 INFO ]: Start removeUnreachable. Operand 506 states. [2018-06-24 21:21:18,400 INFO ]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1039 transitions. [2018-06-24 21:21:18,400 INFO ]: Start accepts. Automaton has 506 states and 1039 transitions. Word has length 5 [2018-06-24 21:21:18,400 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:18,400 INFO ]: Abstraction has 506 states and 1039 transitions. [2018-06-24 21:21:18,400 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:18,401 INFO ]: Start isEmpty. Operand 506 states and 1039 transitions. [2018-06-24 21:21:18,426 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:21:18,427 INFO ]: Found error trace [2018-06-24 21:21:18,427 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:18,427 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:18,427 INFO ]: Analyzing trace with hash -1732643881, now seen corresponding path program 1 times [2018-06-24 21:21:18,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:18,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:18,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:18,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:18,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:18,434 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:18,503 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:18,503 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:18,503 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:18,503 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:18,504 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:18,504 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:18,504 INFO ]: Start difference. First operand 506 states and 1039 transitions. Second operand 3 states. [2018-06-24 21:21:19,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:19,326 INFO ]: Finished difference Result 608 states and 1265 transitions. [2018-06-24 21:21:19,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:19,326 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:21:19,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:19,347 INFO ]: With dead ends: 608 [2018-06-24 21:21:19,347 INFO ]: Without dead ends: 608 [2018-06-24 21:21:19,348 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-24 21:21:19,348 INFO ]: Start minimizeSevpa. Operand 608 states. [2018-06-24 21:21:19,440 INFO ]: Finished minimizeSevpa. Reduced states from 608 to 608. [2018-06-24 21:21:19,440 INFO ]: Start removeUnreachable. Operand 608 states. [2018-06-24 21:21:19,459 INFO ]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1265 transitions. [2018-06-24 21:21:19,460 INFO ]: Start accepts. Automaton has 608 states and 1265 transitions. Word has length 9 [2018-06-24 21:21:19,460 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:19,460 INFO ]: Abstraction has 608 states and 1265 transitions. [2018-06-24 21:21:19,460 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:19,460 INFO ]: Start isEmpty. Operand 608 states and 1265 transitions. [2018-06-24 21:21:19,497 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:21:19,497 INFO ]: Found error trace [2018-06-24 21:21:19,497 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:19,497 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:19,497 INFO ]: Analyzing trace with hash 1608315474, now seen corresponding path program 1 times [2018-06-24 21:21:19,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:19,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:19,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:19,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:19,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:19,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:19,583 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:19,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:19,583 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:19,583 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:19,583 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:19,583 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:19,583 INFO ]: Start difference. First operand 608 states and 1265 transitions. Second operand 3 states. [2018-06-24 21:21:20,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:20,437 INFO ]: Finished difference Result 710 states and 1385 transitions. [2018-06-24 21:21:20,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:20,437 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 21:21:20,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:20,530 INFO ]: With dead ends: 710 [2018-06-24 21:21:20,530 INFO ]: Without dead ends: 710 [2018-06-24 21:21:20,530 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-24 21:21:20,531 INFO ]: Start minimizeSevpa. Operand 710 states. [2018-06-24 21:21:20,639 INFO ]: Finished minimizeSevpa. Reduced states from 710 to 710. [2018-06-24 21:21:20,639 INFO ]: Start removeUnreachable. Operand 710 states. [2018-06-24 21:21:20,674 INFO ]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1385 transitions. [2018-06-24 21:21:20,674 INFO ]: Start accepts. Automaton has 710 states and 1385 transitions. Word has length 10 [2018-06-24 21:21:20,675 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:20,675 INFO ]: Abstraction has 710 states and 1385 transitions. [2018-06-24 21:21:20,675 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:20,675 INFO ]: Start isEmpty. Operand 710 states and 1385 transitions. [2018-06-24 21:21:20,693 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:21:20,693 INFO ]: Found error trace [2018-06-24 21:21:20,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:20,693 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:20,693 INFO ]: Analyzing trace with hash 1759032131, now seen corresponding path program 1 times [2018-06-24 21:21:20,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:20,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:20,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:20,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:20,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:20,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:21,001 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:21,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:21,001 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:21:21,002 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:21,002 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:21,002 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:21,002 INFO ]: Start difference. First operand 710 states and 1385 transitions. Second operand 5 states. [2018-06-24 21:21:22,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:22,158 INFO ]: Finished difference Result 1412 states and 5501 transitions. [2018-06-24 21:21:22,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:21:22,159 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:21:22,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:22,426 INFO ]: With dead ends: 1412 [2018-06-24 21:21:22,426 INFO ]: Without dead ends: 1412 [2018-06-24 21:21:22,426 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:22,427 INFO ]: Start minimizeSevpa. Operand 1412 states. [2018-06-24 21:21:23,117 INFO ]: Finished minimizeSevpa. Reduced states from 1412 to 734. [2018-06-24 21:21:23,117 INFO ]: Start removeUnreachable. Operand 734 states. [2018-06-24 21:21:23,141 INFO ]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1451 transitions. [2018-06-24 21:21:23,141 INFO ]: Start accepts. Automaton has 734 states and 1451 transitions. Word has length 10 [2018-06-24 21:21:23,141 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:23,141 INFO ]: Abstraction has 734 states and 1451 transitions. [2018-06-24 21:21:23,141 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:23,141 INFO ]: Start isEmpty. Operand 734 states and 1451 transitions. [2018-06-24 21:21:23,163 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:21:23,163 INFO ]: Found error trace [2018-06-24 21:21:23,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:23,163 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:23,163 INFO ]: Analyzing trace with hash 1966073088, now seen corresponding path program 1 times [2018-06-24 21:21:23,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:23,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:23,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:23,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:23,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:23,192 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:23,441 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:23,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:23,441 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:21:23,441 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:23,441 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:23,441 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:23,441 INFO ]: Start difference. First operand 734 states and 1451 transitions. Second operand 5 states. [2018-06-24 21:21:25,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:25,811 INFO ]: Finished difference Result 2210 states and 8801 transitions. [2018-06-24 21:21:25,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:21:25,812 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:21:25,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:26,250 INFO ]: With dead ends: 2210 [2018-06-24 21:21:26,251 INFO ]: Without dead ends: 2210 [2018-06-24 21:21:26,251 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:26,252 INFO ]: Start minimizeSevpa. Operand 2210 states. [2018-06-24 21:21:26,852 INFO ]: Finished minimizeSevpa. Reduced states from 2210 to 752. [2018-06-24 21:21:26,852 INFO ]: Start removeUnreachable. Operand 752 states. [2018-06-24 21:21:26,897 INFO ]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1499 transitions. [2018-06-24 21:21:26,897 INFO ]: Start accepts. Automaton has 752 states and 1499 transitions. Word has length 10 [2018-06-24 21:21:26,897 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:26,897 INFO ]: Abstraction has 752 states and 1499 transitions. [2018-06-24 21:21:26,897 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:26,898 INFO ]: Start isEmpty. Operand 752 states and 1499 transitions. [2018-06-24 21:21:26,919 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:21:26,919 INFO ]: Found error trace [2018-06-24 21:21:26,919 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:26,919 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:26,919 INFO ]: Analyzing trace with hash -1855876795, now seen corresponding path program 1 times [2018-06-24 21:21:26,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:26,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:26,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:26,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:26,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:26,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:27,185 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:27,185 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:27,185 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:21:27,185 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:27,186 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:27,186 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:27,186 INFO ]: Start difference. First operand 752 states and 1499 transitions. Second operand 5 states. [2018-06-24 21:21:28,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:28,264 INFO ]: Finished difference Result 1473 states and 5717 transitions. [2018-06-24 21:21:28,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:21:28,265 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:21:28,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:28,404 INFO ]: With dead ends: 1473 [2018-06-24 21:21:28,404 INFO ]: Without dead ends: 1473 [2018-06-24 21:21:28,404 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:28,405 INFO ]: Start minimizeSevpa. Operand 1473 states. [2018-06-24 21:21:28,832 INFO ]: Finished minimizeSevpa. Reduced states from 1473 to 745. [2018-06-24 21:21:28,832 INFO ]: Start removeUnreachable. Operand 745 states. [2018-06-24 21:21:28,853 INFO ]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1492 transitions. [2018-06-24 21:21:28,854 INFO ]: Start accepts. Automaton has 745 states and 1492 transitions. Word has length 10 [2018-06-24 21:21:28,854 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:28,854 INFO ]: Abstraction has 745 states and 1492 transitions. [2018-06-24 21:21:28,854 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:28,854 INFO ]: Start isEmpty. Operand 745 states and 1492 transitions. [2018-06-24 21:21:28,869 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:21:28,869 INFO ]: Found error trace [2018-06-24 21:21:28,869 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:28,869 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:28,869 INFO ]: Analyzing trace with hash -1648835838, now seen corresponding path program 1 times [2018-06-24 21:21:28,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:28,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:28,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:28,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:28,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:28,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:28,995 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:28,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:28,995 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:21:28,995 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:28,995 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:28,995 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:28,995 INFO ]: Start difference. First operand 745 states and 1492 transitions. Second operand 5 states. [2018-06-24 21:21:29,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:29,576 INFO ]: Finished difference Result 2253 states and 8963 transitions. [2018-06-24 21:21:29,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:21:29,576 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:21:29,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:29,840 INFO ]: With dead ends: 2253 [2018-06-24 21:21:29,840 INFO ]: Without dead ends: 2253 [2018-06-24 21:21:29,840 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:29,842 INFO ]: Start minimizeSevpa. Operand 2253 states. [2018-06-24 21:21:30,620 INFO ]: Finished minimizeSevpa. Reduced states from 2253 to 729. [2018-06-24 21:21:30,620 INFO ]: Start removeUnreachable. Operand 729 states. [2018-06-24 21:21:30,642 INFO ]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1442 transitions. [2018-06-24 21:21:30,642 INFO ]: Start accepts. Automaton has 729 states and 1442 transitions. Word has length 10 [2018-06-24 21:21:30,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:30,642 INFO ]: Abstraction has 729 states and 1442 transitions. [2018-06-24 21:21:30,642 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:30,642 INFO ]: Start isEmpty. Operand 729 states and 1442 transitions. [2018-06-24 21:21:30,665 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:21:30,665 INFO ]: Found error trace [2018-06-24 21:21:30,665 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:30,665 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:30,665 INFO ]: Analyzing trace with hash -122692866, now seen corresponding path program 1 times [2018-06-24 21:21:30,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:30,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:30,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:30,674 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:30,747 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:21:30,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:30,747 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:30,748 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:30,748 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:30,748 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:30,748 INFO ]: Start difference. First operand 729 states and 1442 transitions. Second operand 3 states. [2018-06-24 21:21:31,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:31,284 INFO ]: Finished difference Result 833 states and 1649 transitions. [2018-06-24 21:21:31,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:31,284 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 21:21:31,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:31,320 INFO ]: With dead ends: 833 [2018-06-24 21:21:31,320 INFO ]: Without dead ends: 833 [2018-06-24 21:21:31,320 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-24 21:21:31,320 INFO ]: Start minimizeSevpa. Operand 833 states. [2018-06-24 21:21:31,402 INFO ]: Finished minimizeSevpa. Reduced states from 833 to 833. [2018-06-24 21:21:31,402 INFO ]: Start removeUnreachable. Operand 833 states. [2018-06-24 21:21:31,429 INFO ]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1649 transitions. [2018-06-24 21:21:31,430 INFO ]: Start accepts. Automaton has 833 states and 1649 transitions. Word has length 14 [2018-06-24 21:21:31,430 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:31,430 INFO ]: Abstraction has 833 states and 1649 transitions. [2018-06-24 21:21:31,430 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:31,430 INFO ]: Start isEmpty. Operand 833 states and 1649 transitions. [2018-06-24 21:21:31,442 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:21:31,442 INFO ]: Found error trace [2018-06-24 21:21:31,442 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:31,442 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:31,443 INFO ]: Analyzing trace with hash -770834557, now seen corresponding path program 1 times [2018-06-24 21:21:31,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:31,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:31,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:31,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:31,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:31,455 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:31,493 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:21:31,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:31,493 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:31,494 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:31,494 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:31,494 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:31,494 INFO ]: Start difference. First operand 833 states and 1649 transitions. Second operand 3 states. [2018-06-24 21:21:31,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:31,974 INFO ]: Finished difference Result 942 states and 1870 transitions. [2018-06-24 21:21:32,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:32,046 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-24 21:21:32,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:32,097 INFO ]: With dead ends: 942 [2018-06-24 21:21:32,097 INFO ]: Without dead ends: 942 [2018-06-24 21:21:32,097 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-24 21:21:32,098 INFO ]: Start minimizeSevpa. Operand 942 states. [2018-06-24 21:21:32,188 INFO ]: Finished minimizeSevpa. Reduced states from 942 to 942. [2018-06-24 21:21:32,188 INFO ]: Start removeUnreachable. Operand 942 states. [2018-06-24 21:21:32,310 INFO ]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1870 transitions. [2018-06-24 21:21:32,310 INFO ]: Start accepts. Automaton has 942 states and 1870 transitions. Word has length 15 [2018-06-24 21:21:32,310 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:32,310 INFO ]: Abstraction has 942 states and 1870 transitions. [2018-06-24 21:21:32,310 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:32,310 INFO ]: Start isEmpty. Operand 942 states and 1870 transitions. [2018-06-24 21:21:32,340 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:21:32,340 INFO ]: Found error trace [2018-06-24 21:21:32,341 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:32,341 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:32,341 INFO ]: Analyzing trace with hash -1984313272, now seen corresponding path program 1 times [2018-06-24 21:21:32,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:32,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:32,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:32,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:32,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:32,348 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:32,412 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:32,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:32,412 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:32,413 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:32,413 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:32,413 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:32,413 INFO ]: Start difference. First operand 942 states and 1870 transitions. Second operand 3 states. [2018-06-24 21:21:32,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:32,957 INFO ]: Finished difference Result 1046 states and 2096 transitions. [2018-06-24 21:21:32,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:32,958 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-24 21:21:32,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:33,024 INFO ]: With dead ends: 1046 [2018-06-24 21:21:33,024 INFO ]: Without dead ends: 1046 [2018-06-24 21:21:33,024 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-24 21:21:33,024 INFO ]: Start minimizeSevpa. Operand 1046 states. [2018-06-24 21:21:33,124 INFO ]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2018-06-24 21:21:33,124 INFO ]: Start removeUnreachable. Operand 1046 states. [2018-06-24 21:21:33,170 INFO ]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2096 transitions. [2018-06-24 21:21:33,170 INFO ]: Start accepts. Automaton has 1046 states and 2096 transitions. Word has length 20 [2018-06-24 21:21:33,170 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:33,170 INFO ]: Abstraction has 1046 states and 2096 transitions. [2018-06-24 21:21:33,170 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:33,170 INFO ]: Start isEmpty. Operand 1046 states and 2096 transitions. [2018-06-24 21:21:33,206 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:21:33,206 INFO ]: Found error trace [2018-06-24 21:21:33,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:33,207 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:33,207 INFO ]: Analyzing trace with hash 885135158, now seen corresponding path program 1 times [2018-06-24 21:21:33,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:33,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:33,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:33,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:33,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:33,215 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:33,267 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:33,267 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:33,267 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:33,267 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:33,268 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:33,268 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:33,268 INFO ]: Start difference. First operand 1046 states and 2096 transitions. Second operand 3 states. [2018-06-24 21:21:33,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:33,685 INFO ]: Finished difference Result 1150 states and 2274 transitions. [2018-06-24 21:21:33,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:33,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-24 21:21:33,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:33,744 INFO ]: With dead ends: 1150 [2018-06-24 21:21:33,744 INFO ]: Without dead ends: 1150 [2018-06-24 21:21:33,744 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-24 21:21:33,745 INFO ]: Start minimizeSevpa. Operand 1150 states. [2018-06-24 21:21:33,832 INFO ]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2018-06-24 21:21:33,832 INFO ]: Start removeUnreachable. Operand 1150 states. [2018-06-24 21:21:33,868 INFO ]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 2274 transitions. [2018-06-24 21:21:33,868 INFO ]: Start accepts. Automaton has 1150 states and 2274 transitions. Word has length 20 [2018-06-24 21:21:33,868 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:33,868 INFO ]: Abstraction has 1150 states and 2274 transitions. [2018-06-24 21:21:33,868 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:33,868 INFO ]: Start isEmpty. Operand 1150 states and 2274 transitions. [2018-06-24 21:21:33,895 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:21:33,895 INFO ]: Found error trace [2018-06-24 21:21:33,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:33,895 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:33,895 INFO ]: Analyzing trace with hash 565245637, now seen corresponding path program 1 times [2018-06-24 21:21:33,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:33,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:33,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:33,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:33,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:33,923 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:33,964 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:33,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:33,965 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:33,965 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:33,965 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:33,965 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:33,965 INFO ]: Start difference. First operand 1150 states and 2274 transitions. Second operand 3 states. [2018-06-24 21:21:34,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:34,290 INFO ]: Finished difference Result 1254 states and 2466 transitions. [2018-06-24 21:21:34,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:34,290 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-24 21:21:34,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:34,415 INFO ]: With dead ends: 1254 [2018-06-24 21:21:34,415 INFO ]: Without dead ends: 1254 [2018-06-24 21:21:34,416 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-24 21:21:34,417 INFO ]: Start minimizeSevpa. Operand 1254 states. [2018-06-24 21:21:34,536 INFO ]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2018-06-24 21:21:34,536 INFO ]: Start removeUnreachable. Operand 1254 states. [2018-06-24 21:21:34,599 INFO ]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2466 transitions. [2018-06-24 21:21:34,599 INFO ]: Start accepts. Automaton has 1254 states and 2466 transitions. Word has length 20 [2018-06-24 21:21:34,599 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:34,599 INFO ]: Abstraction has 1254 states and 2466 transitions. [2018-06-24 21:21:34,599 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:34,599 INFO ]: Start isEmpty. Operand 1254 states and 2466 transitions. [2018-06-24 21:21:34,627 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:21:34,627 INFO ]: Found error trace [2018-06-24 21:21:34,627 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:34,627 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:34,627 INFO ]: Analyzing trace with hash 1245304007, now seen corresponding path program 1 times [2018-06-24 21:21:34,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:34,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:34,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:34,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:34,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:34,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:34,704 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:34,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:34,705 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:34,705 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:34,705 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:34,705 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:34,705 INFO ]: Start difference. First operand 1254 states and 2466 transitions. Second operand 3 states. [2018-06-24 21:21:34,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:34,975 INFO ]: Finished difference Result 1358 states and 2669 transitions. [2018-06-24 21:21:34,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:34,975 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-24 21:21:34,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:35,098 INFO ]: With dead ends: 1358 [2018-06-24 21:21:35,098 INFO ]: Without dead ends: 1358 [2018-06-24 21:21:35,099 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-24 21:21:35,103 INFO ]: Start minimizeSevpa. Operand 1358 states. [2018-06-24 21:21:35,259 INFO ]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2018-06-24 21:21:35,259 INFO ]: Start removeUnreachable. Operand 1358 states. [2018-06-24 21:21:35,324 INFO ]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2669 transitions. [2018-06-24 21:21:35,324 INFO ]: Start accepts. Automaton has 1358 states and 2669 transitions. Word has length 20 [2018-06-24 21:21:35,324 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:35,324 INFO ]: Abstraction has 1358 states and 2669 transitions. [2018-06-24 21:21:35,324 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:35,325 INFO ]: Start isEmpty. Operand 1358 states and 2669 transitions. [2018-06-24 21:21:35,373 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:21:35,373 INFO ]: Found error trace [2018-06-24 21:21:35,374 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:35,374 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:35,374 INFO ]: Analyzing trace with hash 1440478830, now seen corresponding path program 1 times [2018-06-24 21:21:35,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:35,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:35,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:35,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:35,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:35,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:35,443 INFO ]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:21:35,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:35,443 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:35,443 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:35,443 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:35,443 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:35,444 INFO ]: Start difference. First operand 1358 states and 2669 transitions. Second operand 3 states. [2018-06-24 21:21:35,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:35,967 INFO ]: Finished difference Result 1464 states and 2894 transitions. [2018-06-24 21:21:35,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:35,967 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 21:21:35,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:36,080 INFO ]: With dead ends: 1464 [2018-06-24 21:21:36,080 INFO ]: Without dead ends: 1464 [2018-06-24 21:21:36,080 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-24 21:21:36,081 INFO ]: Start minimizeSevpa. Operand 1464 states. [2018-06-24 21:21:36,219 INFO ]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2018-06-24 21:21:36,219 INFO ]: Start removeUnreachable. Operand 1464 states. [2018-06-24 21:21:36,279 INFO ]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2894 transitions. [2018-06-24 21:21:36,279 INFO ]: Start accepts. Automaton has 1464 states and 2894 transitions. Word has length 24 [2018-06-24 21:21:36,279 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:36,279 INFO ]: Abstraction has 1464 states and 2894 transitions. [2018-06-24 21:21:36,279 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:36,279 INFO ]: Start isEmpty. Operand 1464 states and 2894 transitions. [2018-06-24 21:21:36,323 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:21:36,323 INFO ]: Found error trace [2018-06-24 21:21:36,323 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:36,323 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:36,323 INFO ]: Analyzing trace with hash 1340484858, now seen corresponding path program 1 times [2018-06-24 21:21:36,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:36,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:36,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:36,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:36,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:36,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:36,456 INFO ]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:21:36,457 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:36,457 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:36,457 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:36,457 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:36,457 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:36,457 INFO ]: Start difference. First operand 1464 states and 2894 transitions. Second operand 3 states. [2018-06-24 21:21:38,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:38,758 INFO ]: Finished difference Result 1568 states and 3097 transitions. [2018-06-24 21:21:38,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:38,758 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 21:21:38,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:38,885 INFO ]: With dead ends: 1568 [2018-06-24 21:21:38,885 INFO ]: Without dead ends: 1568 [2018-06-24 21:21:38,885 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-24 21:21:38,886 INFO ]: Start minimizeSevpa. Operand 1568 states. [2018-06-24 21:21:39,024 INFO ]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2018-06-24 21:21:39,024 INFO ]: Start removeUnreachable. Operand 1568 states. [2018-06-24 21:21:39,091 INFO ]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 3097 transitions. [2018-06-24 21:21:39,091 INFO ]: Start accepts. Automaton has 1568 states and 3097 transitions. Word has length 24 [2018-06-24 21:21:39,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:39,091 INFO ]: Abstraction has 1568 states and 3097 transitions. [2018-06-24 21:21:39,091 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:39,091 INFO ]: Start isEmpty. Operand 1568 states and 3097 transitions. [2018-06-24 21:21:39,121 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:21:39,121 INFO ]: Found error trace [2018-06-24 21:21:39,121 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:39,121 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:39,121 INFO ]: Analyzing trace with hash -805452736, now seen corresponding path program 1 times [2018-06-24 21:21:39,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:39,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:39,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:39,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:39,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:39,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:39,180 INFO ]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:21:39,180 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:39,180 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:39,181 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:39,181 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:39,181 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:39,181 INFO ]: Start difference. First operand 1568 states and 3097 transitions. Second operand 3 states. [2018-06-24 21:21:39,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:39,575 INFO ]: Finished difference Result 1672 states and 3280 transitions. [2018-06-24 21:21:39,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:39,575 INFO ]: Start accepts. Automaton has 3 states. Word has length 29 [2018-06-24 21:21:39,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:39,675 INFO ]: With dead ends: 1672 [2018-06-24 21:21:39,675 INFO ]: Without dead ends: 1672 [2018-06-24 21:21:39,675 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-24 21:21:39,676 INFO ]: Start minimizeSevpa. Operand 1672 states. [2018-06-24 21:21:39,832 INFO ]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2018-06-24 21:21:39,832 INFO ]: Start removeUnreachable. Operand 1672 states. [2018-06-24 21:21:39,896 INFO ]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 3280 transitions. [2018-06-24 21:21:39,896 INFO ]: Start accepts. Automaton has 1672 states and 3280 transitions. Word has length 29 [2018-06-24 21:21:39,897 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:39,897 INFO ]: Abstraction has 1672 states and 3280 transitions. [2018-06-24 21:21:39,897 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:39,897 INFO ]: Start isEmpty. Operand 1672 states and 3280 transitions. [2018-06-24 21:21:39,919 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:21:39,919 INFO ]: Found error trace [2018-06-24 21:21:39,919 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:39,919 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:39,919 INFO ]: Analyzing trace with hash 1192555256, now seen corresponding path program 1 times [2018-06-24 21:21:39,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:39,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:39,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:39,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:39,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:39,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:40,037 INFO ]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:21:40,037 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:40,037 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:40,038 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:40,038 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:40,038 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:40,038 INFO ]: Start difference. First operand 1672 states and 3280 transitions. Second operand 3 states. [2018-06-24 21:21:40,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:40,445 INFO ]: Finished difference Result 1776 states and 3484 transitions. [2018-06-24 21:21:40,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:40,445 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-24 21:21:40,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:40,533 INFO ]: With dead ends: 1776 [2018-06-24 21:21:40,533 INFO ]: Without dead ends: 1776 [2018-06-24 21:21:40,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-24 21:21:40,534 INFO ]: Start minimizeSevpa. Operand 1776 states. [2018-06-24 21:21:40,683 INFO ]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2018-06-24 21:21:40,683 INFO ]: Start removeUnreachable. Operand 1776 states. [2018-06-24 21:21:40,763 INFO ]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 3484 transitions. [2018-06-24 21:21:40,763 INFO ]: Start accepts. Automaton has 1776 states and 3484 transitions. Word has length 32 [2018-06-24 21:21:40,764 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:40,764 INFO ]: Abstraction has 1776 states and 3484 transitions. [2018-06-24 21:21:40,764 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:40,764 INFO ]: Start isEmpty. Operand 1776 states and 3484 transitions. [2018-06-24 21:21:40,806 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:21:40,806 INFO ]: Found error trace [2018-06-24 21:21:40,806 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:40,806 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:40,806 INFO ]: Analyzing trace with hash -1240176131, now seen corresponding path program 1 times [2018-06-24 21:21:40,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:40,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:40,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:40,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:40,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:40,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:40,992 INFO ]: Checked inductivity of 65 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:21:40,993 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:40,993 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:41,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:41,787 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:41,803 INFO ]: Computing forward predicates... [2018-06-24 21:21:41,867 INFO ]: Checked inductivity of 65 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:21:41,905 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:41,905 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:21:41,905 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:21:41,905 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:21:41,905 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:41,905 INFO ]: Start difference. First operand 1776 states and 3484 transitions. Second operand 7 states. [2018-06-24 21:21:48,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:48,253 INFO ]: Finished difference Result 4710 states and 16063 transitions. [2018-06-24 21:21:48,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:21:48,254 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-24 21:21:48,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:48,957 INFO ]: With dead ends: 4710 [2018-06-24 21:21:48,957 INFO ]: Without dead ends: 4670 [2018-06-24 21:21:48,957 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:21:48,959 INFO ]: Start minimizeSevpa. Operand 4670 states. [2018-06-24 21:21:50,651 INFO ]: Finished minimizeSevpa. Reduced states from 4670 to 1816. [2018-06-24 21:21:50,651 INFO ]: Start removeUnreachable. Operand 1816 states. [2018-06-24 21:21:50,697 INFO ]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 3675 transitions. [2018-06-24 21:21:50,697 INFO ]: Start accepts. Automaton has 1816 states and 3675 transitions. Word has length 37 [2018-06-24 21:21:50,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:50,697 INFO ]: Abstraction has 1816 states and 3675 transitions. [2018-06-24 21:21:50,697 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:21:50,698 INFO ]: Start isEmpty. Operand 1816 states and 3675 transitions. [2018-06-24 21:21:50,834 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:21:50,834 INFO ]: Found error trace [2018-06-24 21:21:50,834 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:50,834 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:50,835 INFO ]: Analyzing trace with hash -1634542917, now seen corresponding path program 1 times [2018-06-24 21:21:50,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:50,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:50,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:50,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:50,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:50,878 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:51,148 INFO ]: Checked inductivity of 65 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:21:51,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:51,148 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:51,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:51,237 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:51,240 INFO ]: Computing forward predicates... [2018-06-24 21:21:51,256 INFO ]: Checked inductivity of 65 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:21:51,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:51,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:21:51,277 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:51,277 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:51,277 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:51,277 INFO ]: Start difference. First operand 1816 states and 3675 transitions. Second operand 5 states. [2018-06-24 21:21:52,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:52,241 INFO ]: Finished difference Result 4688 states and 15699 transitions. [2018-06-24 21:21:52,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:21:52,242 INFO ]: Start accepts. Automaton has 5 states. Word has length 37 [2018-06-24 21:21:52,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:52,883 INFO ]: With dead ends: 4688 [2018-06-24 21:21:52,883 INFO ]: Without dead ends: 4688 [2018-06-24 21:21:52,883 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:21:52,886 INFO ]: Start minimizeSevpa. Operand 4688 states. [2018-06-24 21:21:54,034 INFO ]: Finished minimizeSevpa. Reduced states from 4688 to 1834. [2018-06-24 21:21:54,034 INFO ]: Start removeUnreachable. Operand 1834 states. [2018-06-24 21:21:54,128 INFO ]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 3770 transitions. [2018-06-24 21:21:54,128 INFO ]: Start accepts. Automaton has 1834 states and 3770 transitions. Word has length 37 [2018-06-24 21:21:54,128 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:54,128 INFO ]: Abstraction has 1834 states and 3770 transitions. [2018-06-24 21:21:54,128 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:54,128 INFO ]: Start isEmpty. Operand 1834 states and 3770 transitions. [2018-06-24 21:21:54,181 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:21:54,181 INFO ]: Found error trace [2018-06-24 21:21:54,181 INFO ]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:54,181 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:54,181 INFO ]: Analyzing trace with hash -1219675671, now seen corresponding path program 1 times [2018-06-24 21:21:54,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:54,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:54,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:54,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:54,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:54,206 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:54,421 INFO ]: Checked inductivity of 62 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 21:21:54,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:54,421 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:54,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:54,503 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:54,507 INFO ]: Computing forward predicates... [2018-06-24 21:21:54,624 INFO ]: Checked inductivity of 62 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:21:54,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:54,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:21:54,645 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:21:54,645 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:21:54,645 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:21:54,646 INFO ]: Start difference. First operand 1834 states and 3770 transitions. Second operand 16 states. Received shutdown request... [2018-06-24 21:21:58,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:21:58,372 WARN ]: Verification canceled [2018-06-24 21:21:58,374 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:21:58,375 WARN ]: Timeout [2018-06-24 21:21:58,376 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:21:58 BasicIcfg [2018-06-24 21:21:58,376 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:21:58,376 INFO ]: Toolchain (without parser) took 50046.21 ms. Allocated memory was 302.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 212.5 MB in the beginning and 998.8 MB in the end (delta: -786.3 MB). Peak memory consumption was 427.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,378 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:21:58,378 INFO ]: ChcToBoogie took 106.63 ms. Allocated memory is still 302.0 MB. Free memory was 211.5 MB in the beginning and 207.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,378 INFO ]: Boogie Preprocessor took 71.74 ms. Allocated memory is still 302.0 MB. Free memory was 207.5 MB in the beginning and 204.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,378 INFO ]: RCFGBuilder took 3125.17 ms. Allocated memory was 302.0 MB in the beginning and 322.4 MB in the end (delta: 20.4 MB). Free memory was 204.5 MB in the beginning and 225.0 MB in the end (delta: -20.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,379 INFO ]: BlockEncodingV2 took 1399.79 ms. Allocated memory was 322.4 MB in the beginning and 353.9 MB in the end (delta: 31.5 MB). Free memory was 225.0 MB in the beginning and 280.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 57.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,379 INFO ]: TraceAbstraction took 45333.79 ms. Allocated memory was 353.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 280.4 MB in the beginning and 998.8 MB in the end (delta: -718.4 MB). Peak memory consumption was 443.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:58,381 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 262 locations, 463 edges - StatisticsResult: Encoded RCFG 202 locations, 404 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 106.63 ms. Allocated memory is still 302.0 MB. Free memory was 211.5 MB in the beginning and 207.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 71.74 ms. Allocated memory is still 302.0 MB. Free memory was 207.5 MB in the beginning and 204.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 3125.17 ms. Allocated memory was 302.0 MB in the beginning and 322.4 MB in the end (delta: 20.4 MB). Free memory was 204.5 MB in the beginning and 225.0 MB in the end (delta: -20.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1399.79 ms. Allocated memory was 322.4 MB in the beginning and 353.9 MB in the end (delta: 31.5 MB). Free memory was 225.0 MB in the beginning and 280.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 57.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45333.79 ms. Allocated memory was 353.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 280.4 MB in the beginning and 998.8 MB in the end (delta: -718.4 MB). Peak memory consumption was 443.4 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 (1834states) and interpolant automaton (currently 17 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (2891 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 202 locations, 1 error locations. TIMEOUT Result, 45.2s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16155 SDtfs, 3010 SDslu, 26842 SDs, 0 SdLazy, 11960 SolverSat, 6150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1834occurred in iteration=21, 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: 8.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 10096 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 20260 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 576/584 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/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-21-58-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-21-58-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-21-58-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-21-58-391.csv Completed graceful shutdown