java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 03:00:32,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 03:00:32,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 03:00:32,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 03:00:32,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 03:00:32,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 03:00:32,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 03:00:32,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 03:00:32,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 03:00:32,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 03:00:32,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 03:00:32,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 03:00:32,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 03:00:32,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 03:00:32,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 03:00:32,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 03:00:32,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 03:00:32,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 03:00:32,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 03:00:32,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 03:00:32,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 03:00:32,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 03:00:32,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 03:00:32,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 03:00:32,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 03:00:32,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 03:00:32,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 03:00:32,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 03:00:32,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 03:00:32,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 03:00:32,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 03:00:32,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 03:00:32,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 03:00:32,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 03:00:32,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 03:00:32,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 03:00:32,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 03:00:32,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 03:00:32,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 03:00:32,082 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 03:00:32,082 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 03:00:32,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 03:00:32,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 03:00:32,084 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 03:00:32,084 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 03:00:32,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 03:00:32,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 03:00:32,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 03:00:32,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 03:00:32,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 03:00:32,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 03:00:32,085 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 03:00:32,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 03:00:32,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 03:00:32,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 03:00:32,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 03:00:32,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 03:00:32,086 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 03:00:32,088 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 03:00:32,088 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 03:00:32,136 INFO ]: Repository-Root is: /tmp [2018-06-27 03:00:32,156 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 03:00:32,161 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 03:00:32,162 INFO ]: Initializing SmtParser... [2018-06-27 03:00:32,163 INFO ]: SmtParser initialized [2018-06-27 03:00:32,163 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 [2018-06-27 03:00:32,165 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-27 03:00:32,255 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 unknown [2018-06-27 03:00:32,516 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 [2018-06-27 03:00:32,520 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 03:00:32,525 INFO ]: Walking toolchain with 5 elements. [2018-06-27 03:00:32,526 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 03:00:32,526 INFO ]: Initializing ChcToBoogie... [2018-06-27 03:00:32,526 INFO ]: ChcToBoogie initialized [2018-06-27 03:00:32,530 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,581 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32 Unit [2018-06-27 03:00:32,581 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 03:00:32,582 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 03:00:32,582 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 03:00:32,582 INFO ]: Boogie Preprocessor initialized [2018-06-27 03:00:32,608 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,608 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,618 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,618 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,632 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,634 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,636 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,638 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 03:00:32,639 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 03:00:32,639 INFO ]: Initializing RCFGBuilder... [2018-06-27 03:00:32,639 INFO ]: RCFGBuilder initialized [2018-06-27 03:00:32,649 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (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-27 03:00:32,668 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 03:00:32,668 INFO ]: Found specification of procedure gotoProc [2018-06-27 03:00:32,668 INFO ]: Found implementation of procedure gotoProc [2018-06-27 03:00:32,668 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 03:00:32,668 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 03:00:32,668 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-27 03:00:32,945 INFO ]: Using library mode [2018-06-27 03:00:32,945 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:32 BoogieIcfgContainer [2018-06-27 03:00:32,945 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 03:00:32,946 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 03:00:32,946 INFO ]: Initializing BlockEncodingV2... [2018-06-27 03:00:32,946 INFO ]: BlockEncodingV2 initialized [2018-06-27 03:00:32,947 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:32" (1/1) ... [2018-06-27 03:00:32,964 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 03:00:32,965 INFO ]: Using Remove infeasible edges [2018-06-27 03:00:32,966 INFO ]: Using Maximize final states [2018-06-27 03:00:32,966 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 03:00:32,966 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 03:00:32,970 INFO ]: Using Remove sink states [2018-06-27 03:00:32,970 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 03:00:32,970 INFO ]: Using Use SBE [2018-06-27 03:00:32,978 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 03:00:33,552 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 03:00:33,632 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 03:00:33,866 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 03:00:33,867 INFO ]: SBE split 2 edges [2018-06-27 03:00:33,887 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 03:00:33,890 INFO ]: 0 new accepting states [2018-06-27 03:00:48,214 INFO ]: Removed 2070 edges and 2 locations by large block encoding [2018-06-27 03:00:48,217 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:48,233 INFO ]: Removed 14 edges and 0 locations because of local infeasibility [2018-06-27 03:00:48,234 INFO ]: 0 new accepting states [2018-06-27 03:00:48,236 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:00:48,236 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:48,243 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 03:00:48,244 INFO ]: 0 new accepting states [2018-06-27 03:00:48,246 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:00:48,247 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:48,261 INFO ]: Encoded RCFG 6 locations, 2058 edges [2018-06-27 03:00:48,261 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:00:48 BasicIcfg [2018-06-27 03:00:48,261 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 03:00:48,264 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 03:00:48,264 INFO ]: Initializing TraceAbstraction... [2018-06-27 03:00:48,267 INFO ]: TraceAbstraction initialized [2018-06-27 03:00:48,267 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:00:32" (1/4) ... [2018-06-27 03:00:48,269 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 03:00:48, skipping insertion in model container [2018-06-27 03:00:48,269 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:32" (2/4) ... [2018-06-27 03:00:48,269 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 03:00:48, skipping insertion in model container [2018-06-27 03:00:48,269 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:32" (3/4) ... [2018-06-27 03:00:48,269 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:00:48, skipping insertion in model container [2018-06-27 03:00:48,269 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:00:48" (4/4) ... [2018-06-27 03:00:48,271 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 03:00:48,281 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 03:00:48,288 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 03:00:48,323 INFO ]: Using default assertion order modulation [2018-06-27 03:00:48,323 INFO ]: Interprodecural is true [2018-06-27 03:00:48,323 INFO ]: Hoare is false [2018-06-27 03:00:48,323 INFO ]: Compute interpolants for FPandBP [2018-06-27 03:00:48,323 INFO ]: Backedges is TWOTRACK [2018-06-27 03:00:48,323 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 03:00:48,324 INFO ]: Difference is false [2018-06-27 03:00:48,324 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 03:00:48,324 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 03:00:48,343 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 03:00:48,361 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:48,361 INFO ]: Found error trace [2018-06-27 03:00:48,362 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:48,362 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:48,367 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-27 03:00:48,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:48,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:48,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:48,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:48,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:48,462 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:48,562 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:48,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:48,563 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:48,564 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:48,576 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:48,576 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:48,579 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 03:00:51,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:51,583 INFO ]: Finished difference Result 8 states and 2063 transitions. [2018-06-27 03:00:51,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:51,585 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:51,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:51,603 INFO ]: With dead ends: 8 [2018-06-27 03:00:51,603 INFO ]: Without dead ends: 8 [2018-06-27 03:00:51,605 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-27 03:00:51,620 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:51,687 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 03:00:51,689 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:51,693 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2062 transitions. [2018-06-27 03:00:51,694 INFO ]: Start accepts. Automaton has 7 states and 2062 transitions. Word has length 5 [2018-06-27 03:00:51,695 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:51,695 INFO ]: Abstraction has 7 states and 2062 transitions. [2018-06-27 03:00:51,695 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:51,695 INFO ]: Start isEmpty. Operand 7 states and 2062 transitions. [2018-06-27 03:00:51,697 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:51,697 INFO ]: Found error trace [2018-06-27 03:00:51,697 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:51,698 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:51,698 INFO ]: Analyzing trace with hash 161096557, now seen corresponding path program 1 times [2018-06-27 03:00:51,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:51,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:51,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:51,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:51,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:51,727 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:51,792 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:51,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:51,792 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:51,793 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:51,793 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:51,793 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:51,793 INFO ]: Start difference. First operand 7 states and 2062 transitions. Second operand 3 states. [2018-06-27 03:00:54,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:54,394 INFO ]: Finished difference Result 9 states and 2064 transitions. [2018-06-27 03:00:54,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:54,395 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:54,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:54,398 INFO ]: With dead ends: 9 [2018-06-27 03:00:54,398 INFO ]: Without dead ends: 9 [2018-06-27 03:00:54,398 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-27 03:00:54,398 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:00:54,410 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 03:00:54,410 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:54,417 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2063 transitions. [2018-06-27 03:00:54,417 INFO ]: Start accepts. Automaton has 8 states and 2063 transitions. Word has length 5 [2018-06-27 03:00:54,417 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:54,417 INFO ]: Abstraction has 8 states and 2063 transitions. [2018-06-27 03:00:54,417 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:54,417 INFO ]: Start isEmpty. Operand 8 states and 2063 transitions. [2018-06-27 03:00:54,419 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:54,419 INFO ]: Found error trace [2018-06-27 03:00:54,419 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:54,419 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:54,419 INFO ]: Analyzing trace with hash 161144607, now seen corresponding path program 1 times [2018-06-27 03:00:54,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:54,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:54,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:54,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:54,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:54,432 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:54,455 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:54,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:54,455 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:54,455 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:54,456 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:54,456 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:54,456 INFO ]: Start difference. First operand 8 states and 2063 transitions. Second operand 3 states. [2018-06-27 03:00:57,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:57,123 INFO ]: Finished difference Result 9 states and 2061 transitions. [2018-06-27 03:00:57,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:57,124 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:57,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:57,127 INFO ]: With dead ends: 9 [2018-06-27 03:00:57,127 INFO ]: Without dead ends: 9 [2018-06-27 03:00:57,127 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-27 03:00:57,127 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:00:57,142 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:00:57,143 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:57,147 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2059 transitions. [2018-06-27 03:00:57,147 INFO ]: Start accepts. Automaton has 7 states and 2059 transitions. Word has length 5 [2018-06-27 03:00:57,147 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:57,147 INFO ]: Abstraction has 7 states and 2059 transitions. [2018-06-27 03:00:57,147 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:57,147 INFO ]: Start isEmpty. Operand 7 states and 2059 transitions. [2018-06-27 03:00:57,149 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:57,149 INFO ]: Found error trace [2018-06-27 03:00:57,149 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:57,149 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:57,149 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-27 03:00:57,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:57,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:57,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:57,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:57,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:57,199 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:57,284 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:57,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:57,284 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:57,284 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:57,284 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:57,284 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:57,285 INFO ]: Start difference. First operand 7 states and 2059 transitions. Second operand 3 states. [2018-06-27 03:00:59,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:59,067 INFO ]: Finished difference Result 8 states and 2059 transitions. [2018-06-27 03:00:59,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:59,097 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:59,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:59,099 INFO ]: With dead ends: 8 [2018-06-27 03:00:59,099 INFO ]: Without dead ends: 7 [2018-06-27 03:00:59,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-27 03:00:59,099 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:59,107 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:59,107 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:59,109 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1035 transitions. [2018-06-27 03:00:59,109 INFO ]: Start accepts. Automaton has 7 states and 1035 transitions. Word has length 6 [2018-06-27 03:00:59,109 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:59,109 INFO ]: Abstraction has 7 states and 1035 transitions. [2018-06-27 03:00:59,109 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:59,109 INFO ]: Start isEmpty. Operand 7 states and 1035 transitions. [2018-06-27 03:00:59,110 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:59,110 INFO ]: Found error trace [2018-06-27 03:00:59,110 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:59,110 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:59,110 INFO ]: Analyzing trace with hash 580632852, now seen corresponding path program 1 times [2018-06-27 03:00:59,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:59,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:59,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:59,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:59,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:59,143 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:59,243 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:59,244 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:59,244 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:59,244 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:59,244 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:59,244 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:59,244 INFO ]: Start difference. First operand 7 states and 1035 transitions. Second operand 3 states. [2018-06-27 03:01:00,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:00,123 INFO ]: Finished difference Result 8 states and 1035 transitions. [2018-06-27 03:01:00,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:00,123 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:00,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:00,124 INFO ]: With dead ends: 8 [2018-06-27 03:01:00,124 INFO ]: Without dead ends: 7 [2018-06-27 03:01:00,124 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-27 03:01:00,124 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:00,128 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:00,128 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:00,129 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2018-06-27 03:01:00,129 INFO ]: Start accepts. Automaton has 7 states and 779 transitions. Word has length 6 [2018-06-27 03:01:00,129 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:00,129 INFO ]: Abstraction has 7 states and 779 transitions. [2018-06-27 03:01:00,129 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:00,129 INFO ]: Start isEmpty. Operand 7 states and 779 transitions. [2018-06-27 03:01:00,130 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:00,130 INFO ]: Found error trace [2018-06-27 03:01:00,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:00,130 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:00,130 INFO ]: Analyzing trace with hash -365976173, now seen corresponding path program 1 times [2018-06-27 03:01:00,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:00,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:00,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:00,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:00,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:00,155 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:00,258 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:00,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:00,259 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:00,259 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:00,259 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:00,259 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:00,259 INFO ]: Start difference. First operand 7 states and 779 transitions. Second operand 3 states. [2018-06-27 03:01:00,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:00,915 INFO ]: Finished difference Result 8 states and 779 transitions. [2018-06-27 03:01:00,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:00,917 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:00,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:00,918 INFO ]: With dead ends: 8 [2018-06-27 03:01:00,918 INFO ]: Without dead ends: 7 [2018-06-27 03:01:00,918 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-27 03:01:00,918 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:00,921 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:00,921 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:00,922 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2018-06-27 03:01:00,922 INFO ]: Start accepts. Automaton has 7 states and 587 transitions. Word has length 6 [2018-06-27 03:01:00,922 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:00,922 INFO ]: Abstraction has 7 states and 587 transitions. [2018-06-27 03:01:00,922 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:00,922 INFO ]: Start isEmpty. Operand 7 states and 587 transitions. [2018-06-27 03:01:00,922 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:00,922 INFO ]: Found error trace [2018-06-27 03:01:00,922 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:00,922 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:00,923 INFO ]: Analyzing trace with hash -363205610, now seen corresponding path program 1 times [2018-06-27 03:01:00,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:00,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:00,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:00,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:00,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:00,950 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:00,982 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:00,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:00,982 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:00,983 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:00,983 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:00,983 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:00,983 INFO ]: Start difference. First operand 7 states and 587 transitions. Second operand 3 states. [2018-06-27 03:01:01,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:01,473 INFO ]: Finished difference Result 8 states and 587 transitions. [2018-06-27 03:01:01,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:01,474 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:01,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:01,475 INFO ]: With dead ends: 8 [2018-06-27 03:01:01,475 INFO ]: Without dead ends: 7 [2018-06-27 03:01:01,475 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-27 03:01:01,475 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:01,477 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:01,477 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:01,477 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 395 transitions. [2018-06-27 03:01:01,477 INFO ]: Start accepts. Automaton has 7 states and 395 transitions. Word has length 6 [2018-06-27 03:01:01,478 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:01,478 INFO ]: Abstraction has 7 states and 395 transitions. [2018-06-27 03:01:01,478 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:01,478 INFO ]: Start isEmpty. Operand 7 states and 395 transitions. [2018-06-27 03:01:01,479 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:01,479 INFO ]: Found error trace [2018-06-27 03:01:01,479 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:01,480 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:01,480 INFO ]: Analyzing trace with hash 584326936, now seen corresponding path program 1 times [2018-06-27 03:01:01,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:01,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:01,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:01,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:01,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:01,497 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:01,561 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:01,561 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:01,561 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:01,561 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:01,561 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:01,561 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:01,561 INFO ]: Start difference. First operand 7 states and 395 transitions. Second operand 3 states. [2018-06-27 03:01:01,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:01,892 INFO ]: Finished difference Result 8 states and 395 transitions. [2018-06-27 03:01:01,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:01,893 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:01,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:01,893 INFO ]: With dead ends: 8 [2018-06-27 03:01:01,893 INFO ]: Without dead ends: 7 [2018-06-27 03:01:01,893 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:01,893 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:01,895 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:01,895 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:01,896 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 299 transitions. [2018-06-27 03:01:01,896 INFO ]: Start accepts. Automaton has 7 states and 299 transitions. Word has length 6 [2018-06-27 03:01:01,896 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:01,896 INFO ]: Abstraction has 7 states and 299 transitions. [2018-06-27 03:01:01,896 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:01,896 INFO ]: Start isEmpty. Operand 7 states and 299 transitions. [2018-06-27 03:01:01,897 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:01,897 INFO ]: Found error trace [2018-06-27 03:01:01,897 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:01,897 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:01,897 INFO ]: Analyzing trace with hash 111484184, now seen corresponding path program 1 times [2018-06-27 03:01:01,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:01,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:01,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:01,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:01,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:01,908 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:01,966 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:01,966 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:01,966 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:01,966 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:01,966 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:01,966 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:01,967 INFO ]: Start difference. First operand 7 states and 299 transitions. Second operand 3 states. [2018-06-27 03:01:02,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:02,225 INFO ]: Finished difference Result 8 states and 299 transitions. [2018-06-27 03:01:02,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:02,226 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:02,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:02,226 INFO ]: With dead ends: 8 [2018-06-27 03:01:02,226 INFO ]: Without dead ends: 7 [2018-06-27 03:01:02,226 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-27 03:01:02,226 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:02,228 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:02,228 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:02,228 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2018-06-27 03:01:02,228 INFO ]: Start accepts. Automaton has 7 states and 227 transitions. Word has length 6 [2018-06-27 03:01:02,228 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:02,228 INFO ]: Abstraction has 7 states and 227 transitions. [2018-06-27 03:01:02,228 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:02,228 INFO ]: Start isEmpty. Operand 7 states and 227 transitions. [2018-06-27 03:01:02,229 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:02,229 INFO ]: Found error trace [2018-06-27 03:01:02,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:02,229 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:02,229 INFO ]: Analyzing trace with hash -360435047, now seen corresponding path program 1 times [2018-06-27 03:01:02,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:02,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:02,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:02,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,240 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:02,350 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:02,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:02,350 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:02,350 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:02,350 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:02,350 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:02,350 INFO ]: Start difference. First operand 7 states and 227 transitions. Second operand 3 states. [2018-06-27 03:01:02,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:02,616 INFO ]: Finished difference Result 8 states and 227 transitions. [2018-06-27 03:01:02,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:02,616 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:02,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:02,617 INFO ]: With dead ends: 8 [2018-06-27 03:01:02,617 INFO ]: Without dead ends: 7 [2018-06-27 03:01:02,617 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-27 03:01:02,617 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:02,618 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:02,618 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:02,618 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-06-27 03:01:02,618 INFO ]: Start accepts. Automaton has 7 states and 155 transitions. Word has length 6 [2018-06-27 03:01:02,618 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:02,618 INFO ]: Abstraction has 7 states and 155 transitions. [2018-06-27 03:01:02,618 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:02,618 INFO ]: Start isEmpty. Operand 7 states and 155 transitions. [2018-06-27 03:01:02,619 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:02,619 INFO ]: Found error trace [2018-06-27 03:01:02,619 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:02,619 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:02,619 INFO ]: Analyzing trace with hash -129554797, now seen corresponding path program 1 times [2018-06-27 03:01:02,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:02,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:02,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:02,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,629 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:02,661 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:02,661 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:02,661 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:02,661 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:02,661 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:02,661 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:02,661 INFO ]: Start difference. First operand 7 states and 155 transitions. Second operand 3 states. [2018-06-27 03:01:02,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:02,807 INFO ]: Finished difference Result 8 states and 155 transitions. [2018-06-27 03:01:02,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:02,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:02,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:02,808 INFO ]: With dead ends: 8 [2018-06-27 03:01:02,808 INFO ]: Without dead ends: 7 [2018-06-27 03:01:02,808 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-27 03:01:02,808 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:02,809 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:02,809 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:02,809 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2018-06-27 03:01:02,809 INFO ]: Start accepts. Automaton has 7 states and 131 transitions. Word has length 6 [2018-06-27 03:01:02,810 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:02,810 INFO ]: Abstraction has 7 states and 131 transitions. [2018-06-27 03:01:02,810 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:02,810 INFO ]: Start isEmpty. Operand 7 states and 131 transitions. [2018-06-27 03:01:02,810 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:02,810 INFO ]: Found error trace [2018-06-27 03:01:02,810 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:02,810 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:02,810 INFO ]: Analyzing trace with hash 349752602, now seen corresponding path program 1 times [2018-06-27 03:01:02,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:02,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:02,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:02,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:02,829 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:02,907 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:02,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:01:02,908 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-27 03:01:02,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:02,976 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:02,986 INFO ]: Computing forward predicates... [2018-06-27 03:01:03,729 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-27 03:01:03,746 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:03,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:01:03,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 03:01:03,779 INFO ]: Interpolant automaton has 5 states [2018-06-27 03:01:03,779 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 03:01:03,779 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-27 03:01:03,779 INFO ]: Start difference. First operand 7 states and 131 transitions. Second operand 5 states. [2018-06-27 03:01:04,023 WARN ]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-27 03:01:05,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:05,081 INFO ]: Finished difference Result 13 states and 137 transitions. [2018-06-27 03:01:05,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 03:01:05,081 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 03:01:05,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:05,081 INFO ]: With dead ends: 13 [2018-06-27 03:01:05,081 INFO ]: Without dead ends: 9 [2018-06-27 03:01:05,082 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-27 03:01:05,082 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:01:05,082 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:01:05,082 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:05,083 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2018-06-27 03:01:05,083 INFO ]: Start accepts. Automaton has 7 states and 81 transitions. Word has length 6 [2018-06-27 03:01:05,083 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:05,083 INFO ]: Abstraction has 7 states and 81 transitions. [2018-06-27 03:01:05,083 INFO ]: Interpolant automaton has 5 states. [2018-06-27 03:01:05,083 INFO ]: Start isEmpty. Operand 7 states and 81 transitions. [2018-06-27 03:01:05,083 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:05,083 INFO ]: Found error trace [2018-06-27 03:01:05,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:05,083 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:05,083 INFO ]: Analyzing trace with hash -10420588, now seen corresponding path program 1 times [2018-06-27 03:01:05,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:05,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:05,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:05,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,106 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:05,134 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:05,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:05,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:05,135 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:05,135 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:05,135 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:05,135 INFO ]: Start difference. First operand 7 states and 81 transitions. Second operand 3 states. [2018-06-27 03:01:05,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:05,204 INFO ]: Finished difference Result 8 states and 81 transitions. [2018-06-27 03:01:05,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:05,204 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:05,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:05,205 INFO ]: With dead ends: 8 [2018-06-27 03:01:05,205 INFO ]: Without dead ends: 7 [2018-06-27 03:01:05,205 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-27 03:01:05,205 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:05,206 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:05,206 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:05,206 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-06-27 03:01:05,206 INFO ]: Start accepts. Automaton has 7 states and 46 transitions. Word has length 6 [2018-06-27 03:01:05,206 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:05,206 INFO ]: Abstraction has 7 states and 46 transitions. [2018-06-27 03:01:05,206 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:05,206 INFO ]: Start isEmpty. Operand 7 states and 46 transitions. [2018-06-27 03:01:05,206 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:05,206 INFO ]: Found error trace [2018-06-27 03:01:05,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:05,206 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:05,206 INFO ]: Analyzing trace with hash 403316820, now seen corresponding path program 1 times [2018-06-27 03:01:05,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:05,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:05,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:05,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,214 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:05,246 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:05,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:05,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:05,247 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:05,247 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:05,247 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:05,247 INFO ]: Start difference. First operand 7 states and 46 transitions. Second operand 3 states. [2018-06-27 03:01:05,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:05,293 INFO ]: Finished difference Result 8 states and 46 transitions. [2018-06-27 03:01:05,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:05,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:01:05,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:05,294 INFO ]: With dead ends: 8 [2018-06-27 03:01:05,294 INFO ]: Without dead ends: 7 [2018-06-27 03:01:05,294 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-27 03:01:05,294 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:05,295 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:05,295 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:05,295 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-06-27 03:01:05,295 INFO ]: Start accepts. Automaton has 7 states and 32 transitions. Word has length 6 [2018-06-27 03:01:05,295 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:05,295 INFO ]: Abstraction has 7 states and 32 transitions. [2018-06-27 03:01:05,295 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:05,295 INFO ]: Start isEmpty. Operand 7 states and 32 transitions. [2018-06-27 03:01:05,295 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:01:05,295 INFO ]: Found error trace [2018-06-27 03:01:05,295 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:01:05,295 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:05,295 INFO ]: Analyzing trace with hash -748313867, now seen corresponding path program 1 times [2018-06-27 03:01:05,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:05,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:05,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:05,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:05,306 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:05,496 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:05,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:01:05,496 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) [2018-06-27 03:01:05,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 03:01:05,555 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:05,557 INFO ]: Computing forward predicates... [2018-06-27 03:01:05,600 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:05,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:01:05,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 03:01:05,631 INFO ]: Interpolant automaton has 4 states [2018-06-27 03:01:05,631 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 03:01:05,631 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 03:01:05,632 INFO ]: Start difference. First operand 7 states and 32 transitions. Second operand 4 states. [2018-06-27 03:01:05,780 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-06-27 03:01:06,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:06,104 INFO ]: Finished difference Result 9 states and 34 transitions. [2018-06-27 03:01:06,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 03:01:06,105 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 03:01:06,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:06,105 INFO ]: With dead ends: 9 [2018-06-27 03:01:06,105 INFO ]: Without dead ends: 9 [2018-06-27 03:01:06,106 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 03:01:06,106 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:01:06,106 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 03:01:06,106 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:01:06,107 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-06-27 03:01:06,107 INFO ]: Start accepts. Automaton has 8 states and 33 transitions. Word has length 6 [2018-06-27 03:01:06,107 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:06,107 INFO ]: Abstraction has 8 states and 33 transitions. [2018-06-27 03:01:06,107 INFO ]: Interpolant automaton has 4 states. [2018-06-27 03:01:06,107 INFO ]: Start isEmpty. Operand 8 states and 33 transitions. [2018-06-27 03:01:06,107 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:01:06,107 INFO ]: Found error trace [2018-06-27 03:01:06,107 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:01:06,107 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:06,107 INFO ]: Analyzing trace with hash -1841852545, now seen corresponding path program 2 times [2018-06-27 03:01:06,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:06,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:06,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:06,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:06,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:06,130 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:06,253 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:06,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:01:06,253 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-27 03:01:06,259 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-27 03:01:06,313 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-27 03:01:06,313 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:06,316 INFO ]: Computing forward predicates... [2018-06-27 03:01:06,831 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:06,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:01:06,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 03:01:06,851 INFO ]: Interpolant automaton has 7 states [2018-06-27 03:01:06,851 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 03:01:06,851 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-27 03:01:06,851 INFO ]: Start difference. First operand 8 states and 33 transitions. Second operand 7 states. [2018-06-27 03:01:07,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:07,065 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-27 03:01:07,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 03:01:07,065 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 03:01:07,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:07,065 INFO ]: With dead ends: 7 [2018-06-27 03:01:07,065 INFO ]: Without dead ends: 0 [2018-06-27 03:01:07,065 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-27 03:01:07,065 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 03:01:07,065 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 03:01:07,065 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 03:01:07,065 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 03:01:07,065 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 03:01:07,065 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:07,065 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 03:01:07,065 INFO ]: Interpolant automaton has 7 states. [2018-06-27 03:01:07,066 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 03:01:07,066 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 03:01:07,067 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 03:01:07,068 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:01:07 BasicIcfg [2018-06-27 03:01:07,068 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 03:01:07,069 INFO ]: Toolchain (without parser) took 34548.41 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 803.2 MB). Free memory was 261.1 MB in the beginning and 743.3 MB in the end (delta: -482.1 MB). Peak memory consumption was 321.1 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,070 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 03:01:07,070 INFO ]: ChcToBoogie took 55.51 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 258.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,070 INFO ]: Boogie Preprocessor took 56.39 ms. Allocated memory is still 308.8 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,071 INFO ]: RCFGBuilder took 306.37 ms. Allocated memory is still 308.8 MB. Free memory was 257.1 MB in the beginning and 243.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,071 INFO ]: BlockEncodingV2 took 15315.91 ms. Allocated memory was 308.8 MB in the beginning and 758.1 MB in the end (delta: 449.3 MB). Free memory was 243.1 MB in the beginning and 461.3 MB in the end (delta: -218.3 MB). Peak memory consumption was 422.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,071 INFO ]: TraceAbstraction took 18804.20 ms. Allocated memory was 758.1 MB in the beginning and 1.1 GB in the end (delta: 353.9 MB). Free memory was 461.3 MB in the beginning and 743.3 MB in the end (delta: -281.9 MB). Peak memory consumption was 72.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:01:07,074 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2058 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.51 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 258.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.39 ms. Allocated memory is still 308.8 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 306.37 ms. Allocated memory is still 308.8 MB. Free memory was 257.1 MB in the beginning and 243.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15315.91 ms. Allocated memory was 308.8 MB in the beginning and 758.1 MB in the end (delta: 449.3 MB). Free memory was 243.1 MB in the beginning and 461.3 MB in the end (delta: -218.3 MB). Peak memory consumption was 422.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18804.20 ms. Allocated memory was 758.1 MB in the beginning and 1.1 GB in the end (delta: 353.9 MB). Free memory was 461.3 MB in the beginning and 743.3 MB in the end (delta: -281.9 MB). Peak memory consumption was 72.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 18.7s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12003 SDtfs, 3 SDslu, 62 SDs, 0 SdLazy, 6043 SolverSat, 6308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 7 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 10 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 10/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_03-01-07-085.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_03-01-07-085.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_03-01-07-085.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_03-01-07-085.csv Received shutdown request...