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/ex3_e8_381_e8_477.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:45:27,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:45:27,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:45:27,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:45:27,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:45:27,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:45:27,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:45:27,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:45:27,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:45:27,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:45:27,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:45:27,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:45:27,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:45:27,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:45:27,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:45:27,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:45:27,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:45:27,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:45:27,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:45:27,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:45:27,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:45:27,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:45:27,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:45:27,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:45:27,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:45:27,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:45:27,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:45:27,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:45:27,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:45:27,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:45:27,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:45:27,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:45:27,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:45:27,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:45:27,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:45:27,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:45:27,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:45:27,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:45:27,948 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:45:27,948 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:45:27,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:45:27,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:45:27,950 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:45:27,950 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:45:27,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:45:27,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:45:27,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:45:27,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:45:27,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:27,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:45:27,952 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:45:27,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:45:27,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:45:27,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:45:27,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:45:27,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:45:27,953 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:45:27,954 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:45:27,955 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:45:28,007 INFO ]: Repository-Root is: /tmp [2018-06-25 03:45:28,028 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:45:28,033 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:45:28,034 INFO ]: Initializing SmtParser... [2018-06-25 03:45:28,034 INFO ]: SmtParser initialized [2018-06-25 03:45:28,035 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e8_477.smt2 [2018-06-25 03:45:28,036 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 03:45:28,124 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e8_477.smt2 unknown [2018-06-25 03:45:28,417 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e8_477.smt2 [2018-06-25 03:45:28,422 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:45:28,435 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:45:28,435 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:45:28,435 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:45:28,435 INFO ]: ChcToBoogie initialized [2018-06-25 03:45:28,438 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,507 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28 Unit [2018-06-25 03:45:28,507 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:45:28,508 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:45:28,508 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:45:28,508 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:45:28,528 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,528 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,535 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,544 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,547 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,549 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,550 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,552 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:45:28,552 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:45:28,552 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:45:28,552 INFO ]: RCFGBuilder initialized [2018-06-25 03:45:28,562 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:28,581 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:45:28,581 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:45:28,581 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:45:28,581 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:45:28,581 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:45:28,581 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 03:45:28,828 INFO ]: Using library mode [2018-06-25 03:45:28,829 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:28 BoogieIcfgContainer [2018-06-25 03:45:28,829 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:45:28,830 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:45:28,830 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:45:28,831 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:45:28,831 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:28" (1/1) ... [2018-06-25 03:45:28,845 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:45:28,847 INFO ]: Using Remove infeasible edges [2018-06-25 03:45:28,847 INFO ]: Using Maximize final states [2018-06-25 03:45:28,847 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:45:28,848 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:45:28,850 INFO ]: Using Remove sink states [2018-06-25 03:45:28,851 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:45:28,851 INFO ]: Using Use SBE [2018-06-25 03:45:28,859 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:45:30,849 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:45:31,553 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:45:31,783 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:45:31,784 INFO ]: SBE split 2 edges [2018-06-25 03:45:31,799 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:45:31,803 INFO ]: 0 new accepting states [2018-06-25 03:45:44,387 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:45:44,389 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:44,402 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 03:45:44,403 INFO ]: 0 new accepting states [2018-06-25 03:45:44,405 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:44,405 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:44,414 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:45:44,415 INFO ]: 0 new accepting states [2018-06-25 03:45:44,418 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:44,418 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:44,427 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 03:45:44,427 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:44 BasicIcfg [2018-06-25 03:45:44,427 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:45:44,429 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:45:44,429 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:45:44,432 INFO ]: TraceAbstraction initialized [2018-06-25 03:45:44,432 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:28" (1/4) ... [2018-06-25 03:45:44,435 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:45:44, skipping insertion in model container [2018-06-25 03:45:44,435 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:28" (2/4) ... [2018-06-25 03:45:44,435 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:45:44, skipping insertion in model container [2018-06-25 03:45:44,436 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:28" (3/4) ... [2018-06-25 03:45:44,436 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:44, skipping insertion in model container [2018-06-25 03:45:44,436 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:44" (4/4) ... [2018-06-25 03:45:44,437 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:45:44,447 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:45:44,455 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:45:44,509 INFO ]: Using default assertion order modulation [2018-06-25 03:45:44,509 INFO ]: Interprodecural is true [2018-06-25 03:45:44,509 INFO ]: Hoare is false [2018-06-25 03:45:44,510 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:45:44,510 INFO ]: Backedges is TWOTRACK [2018-06-25 03:45:44,510 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:45:44,510 INFO ]: Difference is false [2018-06-25 03:45:44,510 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:45:44,510 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:45:44,535 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:45:44,561 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:44,561 INFO ]: Found error trace [2018-06-25 03:45:44,561 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:44,562 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:44,568 INFO ]: Analyzing trace with hash 161087908, now seen corresponding path program 1 times [2018-06-25 03:45:44,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:44,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:44,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:44,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:44,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:44,668 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:44,776 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:44,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:44,779 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:44,781 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:44,796 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:44,796 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:44,798 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:45:47,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:47,950 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 03:45:47,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:47,951 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:47,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:47,965 INFO ]: With dead ends: 7 [2018-06-25 03:45:47,965 INFO ]: Without dead ends: 7 [2018-06-25 03:45:47,967 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:47,982 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:48,028 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:48,030 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:48,033 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:45:48,036 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:45:48,037 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:48,037 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:45:48,037 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:48,037 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:45:48,038 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:48,038 INFO ]: Found error trace [2018-06-25 03:45:48,038 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:48,038 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:48,038 INFO ]: Analyzing trace with hash 579712214, now seen corresponding path program 1 times [2018-06-25 03:45:48,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:48,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:48,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:48,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:48,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:48,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:48,205 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:48,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:48,205 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:48,206 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:48,206 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:48,206 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:48,206 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:45:50,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:50,880 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 03:45:50,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:50,881 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:50,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:50,883 INFO ]: With dead ends: 8 [2018-06-25 03:45:50,883 INFO ]: Without dead ends: 7 [2018-06-25 03:45:50,883 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:50,883 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:50,892 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:50,893 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:50,896 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1546 transitions. [2018-06-25 03:45:50,896 INFO ]: Start accepts. Automaton has 7 states and 1546 transitions. Word has length 6 [2018-06-25 03:45:50,896 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:50,896 INFO ]: Abstraction has 7 states and 1546 transitions. [2018-06-25 03:45:50,896 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:50,896 INFO ]: Start isEmpty. Operand 7 states and 1546 transitions. [2018-06-25 03:45:50,897 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:50,897 INFO ]: Found error trace [2018-06-25 03:45:50,897 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:50,897 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:50,897 INFO ]: Analyzing trace with hash 580635735, now seen corresponding path program 1 times [2018-06-25 03:45:50,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:50,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:50,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:50,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,945 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:50,980 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:50,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:50,980 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:50,980 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:50,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:50,981 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:50,981 INFO ]: Start difference. First operand 7 states and 1546 transitions. Second operand 3 states. [2018-06-25 03:45:53,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:53,174 INFO ]: Finished difference Result 8 states and 1546 transitions. [2018-06-25 03:45:53,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:53,175 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:53,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:53,177 INFO ]: With dead ends: 8 [2018-06-25 03:45:53,177 INFO ]: Without dead ends: 7 [2018-06-25 03:45:53,177 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:53,177 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:53,184 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:53,184 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:53,186 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2018-06-25 03:45:53,186 INFO ]: Start accepts. Automaton has 7 states and 778 transitions. Word has length 6 [2018-06-25 03:45:53,186 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:53,186 INFO ]: Abstraction has 7 states and 778 transitions. [2018-06-25 03:45:53,186 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:53,186 INFO ]: Start isEmpty. Operand 7 states and 778 transitions. [2018-06-25 03:45:53,186 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:53,186 INFO ]: Found error trace [2018-06-25 03:45:53,186 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:53,187 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:53,189 INFO ]: Analyzing trace with hash -365973290, now seen corresponding path program 1 times [2018-06-25 03:45:53,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:53,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:53,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:53,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:53,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:53,210 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:53,331 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:53,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:53,331 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:53,332 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:53,332 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:53,332 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:53,332 INFO ]: Start difference. First operand 7 states and 778 transitions. Second operand 3 states. [2018-06-25 03:45:53,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:53,991 INFO ]: Finished difference Result 8 states and 778 transitions. [2018-06-25 03:45:53,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:53,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:53,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:53,992 INFO ]: With dead ends: 8 [2018-06-25 03:45:53,992 INFO ]: Without dead ends: 7 [2018-06-25 03:45:53,992 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:53,992 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:53,996 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:53,996 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:53,996 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2018-06-25 03:45:53,997 INFO ]: Start accepts. Automaton has 7 states and 522 transitions. Word has length 6 [2018-06-25 03:45:53,997 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:53,997 INFO ]: Abstraction has 7 states and 522 transitions. [2018-06-25 03:45:53,997 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:53,997 INFO ]: Start isEmpty. Operand 7 states and 522 transitions. [2018-06-25 03:45:53,997 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:53,997 INFO ]: Found error trace [2018-06-25 03:45:53,997 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:53,997 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:53,997 INFO ]: Analyzing trace with hash -364126248, now seen corresponding path program 1 times [2018-06-25 03:45:53,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:53,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:53,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:53,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:53,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:54,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:54,048 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:54,048 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:54,048 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:54,049 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:54,049 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:54,049 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:54,049 INFO ]: Start difference. First operand 7 states and 522 transitions. Second operand 3 states. [2018-06-25 03:45:54,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:54,498 INFO ]: Finished difference Result 8 states and 522 transitions. [2018-06-25 03:45:54,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:54,498 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:54,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:54,499 INFO ]: With dead ends: 8 [2018-06-25 03:45:54,499 INFO ]: Without dead ends: 7 [2018-06-25 03:45:54,499 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:54,499 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:54,502 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:54,502 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:54,504 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 03:45:54,504 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 03:45:54,504 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:54,504 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 03:45:54,504 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:54,504 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 03:45:54,504 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:54,504 INFO ]: Found error trace [2018-06-25 03:45:54,504 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:54,504 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:54,505 INFO ]: Analyzing trace with hash 106869462, now seen corresponding path program 1 times [2018-06-25 03:45:54,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:54,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:54,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:54,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:54,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:54,533 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:54,562 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:54,562 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:54,562 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:54,563 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:54,563 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:54,563 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:54,563 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 03:45:54,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:54,877 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 03:45:54,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:54,878 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:54,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:54,878 INFO ]: With dead ends: 8 [2018-06-25 03:45:54,878 INFO ]: Without dead ends: 7 [2018-06-25 03:45:54,879 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:54,879 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:54,881 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:54,881 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:54,883 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2018-06-25 03:45:54,883 INFO ]: Start accepts. Automaton has 7 states and 298 transitions. Word has length 6 [2018-06-25 03:45:54,883 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:54,883 INFO ]: Abstraction has 7 states and 298 transitions. [2018-06-25 03:45:54,883 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:54,883 INFO ]: Start isEmpty. Operand 7 states and 298 transitions. [2018-06-25 03:45:54,883 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:54,883 INFO ]: Found error trace [2018-06-25 03:45:54,883 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:54,884 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:54,884 INFO ]: Analyzing trace with hash 582482777, now seen corresponding path program 1 times [2018-06-25 03:45:54,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:54,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:54,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:54,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:54,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:54,914 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:55,007 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:55,007 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:55,007 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:55,007 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:55,007 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:55,007 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,008 INFO ]: Start difference. First operand 7 states and 298 transitions. Second operand 3 states. [2018-06-25 03:45:55,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:55,252 INFO ]: Finished difference Result 8 states and 298 transitions. [2018-06-25 03:45:55,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:55,254 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:55,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:55,255 INFO ]: With dead ends: 8 [2018-06-25 03:45:55,255 INFO ]: Without dead ends: 7 [2018-06-25 03:45:55,255 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,255 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:55,257 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:55,257 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:55,257 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2018-06-25 03:45:55,257 INFO ]: Start accepts. Automaton has 7 states and 250 transitions. Word has length 6 [2018-06-25 03:45:55,257 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:55,257 INFO ]: Abstraction has 7 states and 250 transitions. [2018-06-25 03:45:55,257 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:55,257 INFO ]: Start isEmpty. Operand 7 states and 250 transitions. [2018-06-25 03:45:55,259 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:55,259 INFO ]: Found error trace [2018-06-25 03:45:55,259 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:55,259 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:55,259 INFO ]: Analyzing trace with hash -362279206, now seen corresponding path program 1 times [2018-06-25 03:45:55,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:55,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:55,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:55,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,283 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:55,318 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:55,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:55,318 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:55,318 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:55,318 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:55,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,319 INFO ]: Start difference. First operand 7 states and 250 transitions. Second operand 3 states. [2018-06-25 03:45:55,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:55,549 INFO ]: Finished difference Result 8 states and 250 transitions. [2018-06-25 03:45:55,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:55,549 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:55,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:55,549 INFO ]: With dead ends: 8 [2018-06-25 03:45:55,549 INFO ]: Without dead ends: 7 [2018-06-25 03:45:55,549 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,549 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:55,551 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:55,551 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:55,551 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2018-06-25 03:45:55,551 INFO ]: Start accepts. Automaton has 7 states and 154 transitions. Word has length 6 [2018-06-25 03:45:55,551 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:55,551 INFO ]: Abstraction has 7 states and 154 transitions. [2018-06-25 03:45:55,551 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:55,551 INFO ]: Start isEmpty. Operand 7 states and 154 transitions. [2018-06-25 03:45:55,552 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:55,552 INFO ]: Found error trace [2018-06-25 03:45:55,552 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:55,552 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:55,552 INFO ]: Analyzing trace with hash -1073390376, now seen corresponding path program 1 times [2018-06-25 03:45:55,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:55,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:55,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:55,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,562 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:55,682 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:55,683 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:55,683 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:55,683 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:55,683 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:55,683 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,683 INFO ]: Start difference. First operand 7 states and 154 transitions. Second operand 3 states. [2018-06-25 03:45:55,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:55,831 INFO ]: Finished difference Result 8 states and 154 transitions. [2018-06-25 03:45:55,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:55,831 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:55,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:55,832 INFO ]: With dead ends: 8 [2018-06-25 03:45:55,832 INFO ]: Without dead ends: 7 [2018-06-25 03:45:55,832 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:55,832 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:55,833 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:55,833 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:55,833 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2018-06-25 03:45:55,833 INFO ]: Start accepts. Automaton has 7 states and 130 transitions. Word has length 6 [2018-06-25 03:45:55,833 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:55,833 INFO ]: Abstraction has 7 states and 130 transitions. [2018-06-25 03:45:55,834 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:55,834 INFO ]: Start isEmpty. Operand 7 states and 130 transitions. [2018-06-25 03:45:55,834 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:55,834 INFO ]: Found error trace [2018-06-25 03:45:55,834 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:55,834 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:55,834 INFO ]: Analyzing trace with hash -600547624, now seen corresponding path program 1 times [2018-06-25 03:45:55,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:55,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:55,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:55,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:55,858 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:56,011 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:56,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:56,011 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-25 03:45:56,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:56,068 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:56,077 INFO ]: Computing forward predicates... [2018-06-25 03:45:57,042 WARN ]: Spent 434.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2018-06-25 03:45:57,051 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:57,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:57,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:45:57,078 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:45:57,078 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:45:57,078 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:45:57,078 INFO ]: Start difference. First operand 7 states and 130 transitions. Second operand 6 states. [2018-06-25 03:45:57,654 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 03:45:58,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:58,422 INFO ]: Finished difference Result 17 states and 140 transitions. [2018-06-25 03:45:58,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 03:45:58,423 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:45:58,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:58,425 INFO ]: With dead ends: 17 [2018-06-25 03:45:58,425 INFO ]: Without dead ends: 9 [2018-06-25 03:45:58,425 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-25 03:45:58,425 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:45:58,432 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:45:58,432 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:58,433 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-25 03:45:58,433 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 6 [2018-06-25 03:45:58,433 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:58,433 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-25 03:45:58,433 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:45:58,433 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-25 03:45:58,433 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:58,433 INFO ]: Found error trace [2018-06-25 03:45:58,433 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:58,433 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:58,433 INFO ]: Analyzing trace with hash 464272089, now seen corresponding path program 1 times [2018-06-25 03:45:58,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:58,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:58,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:58,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:58,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:58,445 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:58,552 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:58,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:58,552 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:58,552 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:58,552 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:58,552 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:58,552 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-25 03:45:58,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:58,878 INFO ]: Finished difference Result 8 states and 70 transitions. [2018-06-25 03:45:58,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:58,878 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:58,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:58,878 INFO ]: With dead ends: 8 [2018-06-25 03:45:58,878 INFO ]: Without dead ends: 7 [2018-06-25 03:45:58,878 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:58,878 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:58,879 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:58,879 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:58,880 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-06-25 03:45:58,880 INFO ]: Start accepts. Automaton has 7 states and 50 transitions. Word has length 6 [2018-06-25 03:45:58,880 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:58,880 INFO ]: Abstraction has 7 states and 50 transitions. [2018-06-25 03:45:58,880 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:58,880 INFO ]: Start isEmpty. Operand 7 states and 50 transitions. [2018-06-25 03:45:58,880 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:58,880 INFO ]: Found error trace [2018-06-25 03:45:58,880 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:58,880 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:58,880 INFO ]: Analyzing trace with hash 50534681, now seen corresponding path program 1 times [2018-06-25 03:45:58,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:58,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:58,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:58,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:58,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:58,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:58,931 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:58,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:58,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:58,932 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:58,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:58,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:58,932 INFO ]: Start difference. First operand 7 states and 50 transitions. Second operand 3 states. [2018-06-25 03:45:59,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:59,009 INFO ]: Finished difference Result 8 states and 50 transitions. [2018-06-25 03:45:59,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:59,009 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:59,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:59,009 INFO ]: With dead ends: 8 [2018-06-25 03:45:59,009 INFO ]: Without dead ends: 7 [2018-06-25 03:45:59,010 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:59,010 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:59,010 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:59,011 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:59,011 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-06-25 03:45:59,011 INFO ]: Start accepts. Automaton has 7 states and 40 transitions. Word has length 6 [2018-06-25 03:45:59,011 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:59,011 INFO ]: Abstraction has 7 states and 40 transitions. [2018-06-25 03:45:59,011 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:59,011 INFO ]: Start isEmpty. Operand 7 states and 40 transitions. [2018-06-25 03:45:59,011 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:59,011 INFO ]: Found error trace [2018-06-25 03:45:59,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:59,011 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:59,011 INFO ]: Analyzing trace with hash 287879578, now seen corresponding path program 1 times [2018-06-25 03:45:59,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:59,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:59,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:59,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,020 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:59,133 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:59,133 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:59,133 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:59,133 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:59,133 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:59,133 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:59,133 INFO ]: Start difference. First operand 7 states and 40 transitions. Second operand 3 states. [2018-06-25 03:45:59,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:59,565 INFO ]: Finished difference Result 8 states and 40 transitions. [2018-06-25 03:45:59,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:59,566 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:59,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:59,566 INFO ]: With dead ends: 8 [2018-06-25 03:45:59,566 INFO ]: Without dead ends: 7 [2018-06-25 03:45:59,566 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:59,566 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:59,567 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:59,567 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:59,567 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-06-25 03:45:59,567 INFO ]: Start accepts. Automaton has 7 states and 25 transitions. Word has length 6 [2018-06-25 03:45:59,567 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:59,567 INFO ]: Abstraction has 7 states and 25 transitions. [2018-06-25 03:45:59,567 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:59,567 INFO ]: Start isEmpty. Operand 7 states and 25 transitions. [2018-06-25 03:45:59,567 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:59,567 INFO ]: Found error trace [2018-06-25 03:45:59,567 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:59,568 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:59,568 INFO ]: Analyzing trace with hash -572841994, now seen corresponding path program 1 times [2018-06-25 03:45:59,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:59,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:59,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:59,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:59,689 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:59,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:59,690 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:59,690 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:59,690 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:59,690 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:59,690 INFO ]: Start difference. First operand 7 states and 25 transitions. Second operand 3 states. [2018-06-25 03:45:59,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:59,944 INFO ]: Finished difference Result 8 states and 25 transitions. [2018-06-25 03:45:59,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:59,945 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:59,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:59,945 INFO ]: With dead ends: 8 [2018-06-25 03:45:59,945 INFO ]: Without dead ends: 7 [2018-06-25 03:45:59,945 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:59,945 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:59,946 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:59,946 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:59,946 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-06-25 03:45:59,946 INFO ]: Start accepts. Automaton has 7 states and 20 transitions. Word has length 6 [2018-06-25 03:45:59,946 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:59,946 INFO ]: Abstraction has 7 states and 20 transitions. [2018-06-25 03:45:59,946 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:59,946 INFO ]: Start isEmpty. Operand 7 states and 20 transitions. [2018-06-25 03:45:59,946 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:59,946 INFO ]: Found error trace [2018-06-25 03:45:59,946 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:59,946 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:59,946 INFO ]: Analyzing trace with hash -232062745, now seen corresponding path program 1 times [2018-06-25 03:45:59,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:59,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:59,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:59,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:59,954 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:00,134 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:00,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:00,134 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-25 03:46:00,149 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-25 03:46:00,189 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:00,191 INFO ]: Computing forward predicates... [2018-06-25 03:46:00,232 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:00,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:00,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:46:00,263 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:46:00,263 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:46:00,263 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:46:00,263 INFO ]: Start difference. First operand 7 states and 20 transitions. Second operand 4 states. [2018-06-25 03:46:00,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:00,812 INFO ]: Finished difference Result 9 states and 22 transitions. [2018-06-25 03:46:00,813 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:46:00,813 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:46:00,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:00,814 INFO ]: With dead ends: 9 [2018-06-25 03:46:00,814 INFO ]: Without dead ends: 9 [2018-06-25 03:46:00,814 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:46:00,814 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:46:00,815 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 03:46:00,815 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:00,815 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 03:46:00,815 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 6 [2018-06-25 03:46:00,815 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:00,815 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 03:46:00,815 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:46:00,815 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 03:46:00,815 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:00,815 INFO ]: Found error trace [2018-06-25 03:46:00,815 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:00,815 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:00,815 INFO ]: Analyzing trace with hash 1276943859, now seen corresponding path program 2 times [2018-06-25 03:46:00,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:00,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:00,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:00,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:00,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:00,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:01,009 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:01,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:01,009 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-25 03:46:01,015 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 03:46:01,075 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 03:46:01,075 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:01,078 INFO ]: Computing forward predicates... [2018-06-25 03:46:01,270 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:01,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:01,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:46:01,290 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:46:01,290 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:46:01,290 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:46:01,290 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 7 states. [2018-06-25 03:46:01,465 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-06-25 03:46:01,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:01,493 INFO ]: Finished difference Result 7 states and 16 transitions. [2018-06-25 03:46:01,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 03:46:01,493 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:46:01,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:01,493 INFO ]: With dead ends: 7 [2018-06-25 03:46:01,493 INFO ]: Without dead ends: 0 [2018-06-25 03:46:01,493 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-25 03:46:01,493 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:46:01,494 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:46:01,494 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:46:01,494 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:46:01,494 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:46:01,494 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:01,494 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:46:01,494 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:46:01,494 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:46:01,494 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:46:01,496 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:46:01,497 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:01 BasicIcfg [2018-06-25 03:46:01,497 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:46:01,499 INFO ]: Toolchain (without parser) took 33076.75 ms. Allocated memory was 305.7 MB in the beginning and 1.1 GB in the end (delta: 782.8 MB). Free memory was 258.0 MB in the beginning and 850.6 MB in the end (delta: -592.6 MB). Peak memory consumption was 190.2 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:01,499 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:46:01,500 INFO ]: ChcToBoogie took 72.18 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 255.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:01,500 INFO ]: Boogie Preprocessor took 44.21 ms. Allocated memory is still 305.7 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:01,501 INFO ]: RCFGBuilder took 276.70 ms. Allocated memory is still 305.7 MB. Free memory was 254.0 MB in the beginning and 240.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:01,501 INFO ]: BlockEncodingV2 took 15597.51 ms. Allocated memory was 305.7 MB in the beginning and 766.5 MB in the end (delta: 460.8 MB). Free memory was 240.0 MB in the beginning and 506.4 MB in the end (delta: -266.5 MB). Peak memory consumption was 433.4 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:01,502 INFO ]: TraceAbstraction took 17068.34 ms. Allocated memory was 766.5 MB in the beginning and 1.1 GB in the end (delta: 321.9 MB). Free memory was 506.4 MB in the beginning and 850.6 MB in the end (delta: -344.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:46:01,505 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, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.18 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 255.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.21 ms. Allocated memory is still 305.7 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 276.70 ms. Allocated memory is still 305.7 MB. Free memory was 254.0 MB in the beginning and 240.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15597.51 ms. Allocated memory was 305.7 MB in the beginning and 766.5 MB in the end (delta: 460.8 MB). Free memory was 240.0 MB in the beginning and 506.4 MB in the end (delta: -266.5 MB). Peak memory consumption was 433.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 17068.34 ms. Allocated memory was 766.5 MB in the beginning and 1.1 GB in the end (delta: 321.9 MB). Free memory was 506.4 MB in the beginning and 850.6 MB in the end (delta: -344.1 MB). There was no memory consumed. 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, 16.9s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8387 SDtfs, 0 SDslu, 66 SDs, 0 SdLazy, 4551 SolverSat, 4244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=15, 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, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 1170 SizeOfPredicates, 10 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 12/22 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/ex3_e8_381_e8_477.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-46-02-054.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e8_477.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-46-02-054.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e8_477.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-46-02-054.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e8_477.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-46-02-054.csv Received shutdown request...