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/llreve-bench/smt2/faulty__add-horn!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:41:10,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:41:10,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:41:10,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:41:10,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:41:10,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:41:10,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:41:10,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:41:10,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:41:10,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:41:10,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:41:10,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:41:10,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:41:10,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:41:10,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:41:10,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:41:10,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:41:10,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:41:10,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:41:10,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:41:10,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:41:10,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:41:10,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:41:10,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:41:10,108 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:41:10,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:41:10,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:41:10,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:41:10,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:41:10,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:41:10,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:41:10,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:41:10,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:41:10,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:41:10,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:41:10,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:41:10,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:41:10,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:41:10,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:41:10,154 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:41:10,154 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:41:10,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:41:10,155 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:41:10,156 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:41:10,156 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:41:10,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:41:10,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:41:10,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:41:10,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:41:10,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:41:10,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:41:10,157 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:41:10,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:41:10,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:41:10,158 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:41:10,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:41:10,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:41:10,159 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:41:10,160 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:41:10,161 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:41:10,211 INFO ]: Repository-Root is: /tmp [2018-06-26 18:41:10,227 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:41:10,234 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:41:10,236 INFO ]: Initializing SmtParser... [2018-06-26 18:41:10,237 INFO ]: SmtParser initialized [2018-06-26 18:41:10,237 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-26 18:41:10,238 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-26 18:41:10,324 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3c5db228 [2018-06-26 18:41:10,635 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-26 18:41:10,649 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:41:10,656 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:41:10,657 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:41:10,657 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:41:10,657 INFO ]: ChcToBoogie initialized [2018-06-26 18:41:10,661 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,713 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10 Unit [2018-06-26 18:41:10,713 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:41:10,714 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:41:10,714 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:41:10,714 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:41:10,729 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,729 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,735 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,735 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,746 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,750 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,751 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (1/1) ... [2018-06-26 18:41:10,754 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:41:10,754 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:41:10,754 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:41:10,754 INFO ]: RCFGBuilder initialized [2018-06-26 18:41:10,755 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (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-26 18:41:10,773 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:41:10,773 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:41:10,773 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:41:10,773 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:41:10,773 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:41:10,773 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-26 18:41:11,289 INFO ]: Using library mode [2018-06-26 18:41:11,289 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:11 BoogieIcfgContainer [2018-06-26 18:41:11,289 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:41:11,290 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:41:11,290 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:41:11,291 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:41:11,291 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:11" (1/1) ... [2018-06-26 18:41:11,311 INFO ]: Initial Icfg 33 locations, 69 edges [2018-06-26 18:41:11,313 INFO ]: Using Remove infeasible edges [2018-06-26 18:41:11,314 INFO ]: Using Maximize final states [2018-06-26 18:41:11,314 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:41:11,314 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:41:11,316 INFO ]: Using Remove sink states [2018-06-26 18:41:11,316 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:41:11,317 INFO ]: Using Use SBE [2018-06-26 18:41:11,326 INFO ]: SBE split 0 edges [2018-06-26 18:41:11,331 INFO ]: Removed 6 edges and 2 locations because of local infeasibility [2018-06-26 18:41:11,333 INFO ]: 0 new accepting states [2018-06-26 18:41:11,434 INFO ]: Removed 22 edges and 6 locations by large block encoding [2018-06-26 18:41:11,436 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:11,438 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:41:11,441 INFO ]: 0 new accepting states [2018-06-26 18:41:11,442 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:41:11,442 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:11,442 INFO ]: Encoded RCFG 25 locations, 57 edges [2018-06-26 18:41:11,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:11 BasicIcfg [2018-06-26 18:41:11,443 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:41:11,444 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:41:11,444 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:41:11,450 INFO ]: TraceAbstraction initialized [2018-06-26 18:41:11,450 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:10" (1/4) ... [2018-06-26 18:41:11,452 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c21a489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:41:11, skipping insertion in model container [2018-06-26 18:41:11,452 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:10" (2/4) ... [2018-06-26 18:41:11,452 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c21a489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:41:11, skipping insertion in model container [2018-06-26 18:41:11,452 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:11" (3/4) ... [2018-06-26 18:41:11,452 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c21a489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:41:11, skipping insertion in model container [2018-06-26 18:41:11,452 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:11" (4/4) ... [2018-06-26 18:41:11,454 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:41:11,465 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:41:11,481 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:41:11,529 INFO ]: Using default assertion order modulation [2018-06-26 18:41:11,529 INFO ]: Interprodecural is true [2018-06-26 18:41:11,529 INFO ]: Hoare is false [2018-06-26 18:41:11,529 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:41:11,529 INFO ]: Backedges is TWOTRACK [2018-06-26 18:41:11,530 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:41:11,530 INFO ]: Difference is false [2018-06-26 18:41:11,530 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:41:11,530 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:41:11,545 INFO ]: Start isEmpty. Operand 25 states. [2018-06-26 18:41:11,562 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:41:11,562 INFO ]: Found error trace [2018-06-26 18:41:11,563 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:41:11,563 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:11,567 INFO ]: Analyzing trace with hash 40115109, now seen corresponding path program 1 times [2018-06-26 18:41:11,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:11,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:11,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:11,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:11,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:11,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:11,715 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:11,717 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:11,717 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:11,718 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:11,731 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:11,732 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:11,734 INFO ]: Start difference. First operand 25 states. Second operand 3 states. [2018-06-26 18:41:12,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:12,095 INFO ]: Finished difference Result 47 states and 110 transitions. [2018-06-26 18:41:12,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:12,097 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:41:12,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:12,109 INFO ]: With dead ends: 47 [2018-06-26 18:41:12,109 INFO ]: Without dead ends: 47 [2018-06-26 18:41:12,110 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-26 18:41:12,124 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 18:41:12,154 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-26 18:41:12,155 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 18:41:12,158 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 110 transitions. [2018-06-26 18:41:12,159 INFO ]: Start accepts. Automaton has 47 states and 110 transitions. Word has length 5 [2018-06-26 18:41:12,160 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:12,160 INFO ]: Abstraction has 47 states and 110 transitions. [2018-06-26 18:41:12,160 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:12,160 INFO ]: Start isEmpty. Operand 47 states and 110 transitions. [2018-06-26 18:41:12,165 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:12,165 INFO ]: Found error trace [2018-06-26 18:41:12,165 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:12,165 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:12,165 INFO ]: Analyzing trace with hash 1248942594, now seen corresponding path program 1 times [2018-06-26 18:41:12,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:12,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:12,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:12,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,182 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:12,256 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:12,256 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:12,256 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:12,259 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:12,259 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:12,259 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:12,259 INFO ]: Start difference. First operand 47 states and 110 transitions. Second operand 3 states. [2018-06-26 18:41:12,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:12,376 INFO ]: Finished difference Result 59 states and 151 transitions. [2018-06-26 18:41:12,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:12,378 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:12,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:12,387 INFO ]: With dead ends: 59 [2018-06-26 18:41:12,387 INFO ]: Without dead ends: 59 [2018-06-26 18:41:12,388 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-26 18:41:12,388 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 18:41:12,411 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-06-26 18:41:12,411 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 18:41:12,413 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2018-06-26 18:41:12,413 INFO ]: Start accepts. Automaton has 49 states and 112 transitions. Word has length 6 [2018-06-26 18:41:12,413 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:12,413 INFO ]: Abstraction has 49 states and 112 transitions. [2018-06-26 18:41:12,413 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:12,414 INFO ]: Start isEmpty. Operand 49 states and 112 transitions. [2018-06-26 18:41:12,419 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:12,419 INFO ]: Found error trace [2018-06-26 18:41:12,419 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:12,419 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:12,419 INFO ]: Analyzing trace with hash 1249988162, now seen corresponding path program 1 times [2018-06-26 18:41:12,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:12,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:12,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:12,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,436 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:12,504 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:12,504 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:12,504 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:12,504 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:12,504 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:12,504 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:12,504 INFO ]: Start difference. First operand 49 states and 112 transitions. Second operand 3 states. [2018-06-26 18:41:12,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:12,623 INFO ]: Finished difference Result 61 states and 147 transitions. [2018-06-26 18:41:12,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:12,623 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:12,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:12,627 INFO ]: With dead ends: 61 [2018-06-26 18:41:12,627 INFO ]: Without dead ends: 61 [2018-06-26 18:41:12,627 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-26 18:41:12,627 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 18:41:12,646 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-26 18:41:12,646 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:41:12,648 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2018-06-26 18:41:12,648 INFO ]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 6 [2018-06-26 18:41:12,648 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:12,648 INFO ]: Abstraction has 51 states and 114 transitions. [2018-06-26 18:41:12,648 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:12,648 INFO ]: Start isEmpty. Operand 51 states and 114 transitions. [2018-06-26 18:41:12,650 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:12,651 INFO ]: Found error trace [2018-06-26 18:41:12,651 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:12,651 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:12,651 INFO ]: Analyzing trace with hash 1250789636, now seen corresponding path program 1 times [2018-06-26 18:41:12,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:12,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:12,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:12,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:12,703 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:12,703 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:12,703 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:12,703 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:12,703 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:12,703 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:12,703 INFO ]: Start difference. First operand 51 states and 114 transitions. Second operand 3 states. [2018-06-26 18:41:12,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:12,718 INFO ]: Finished difference Result 62 states and 153 transitions. [2018-06-26 18:41:12,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:12,720 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:12,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:12,722 INFO ]: With dead ends: 62 [2018-06-26 18:41:12,722 INFO ]: Without dead ends: 62 [2018-06-26 18:41:12,723 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-26 18:41:12,723 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-26 18:41:12,733 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-06-26 18:41:12,733 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:41:12,735 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 112 transitions. [2018-06-26 18:41:12,735 INFO ]: Start accepts. Automaton has 50 states and 112 transitions. Word has length 6 [2018-06-26 18:41:12,735 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:12,735 INFO ]: Abstraction has 50 states and 112 transitions. [2018-06-26 18:41:12,735 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:12,735 INFO ]: Start isEmpty. Operand 50 states and 112 transitions. [2018-06-26 18:41:12,737 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:12,737 INFO ]: Found error trace [2018-06-26 18:41:12,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:12,738 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:12,738 INFO ]: Analyzing trace with hash 1252489645, now seen corresponding path program 1 times [2018-06-26 18:41:12,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:12,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:12,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:12,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:12,774 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:12,808 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:12,808 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:12,808 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:12,808 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:12,809 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:12,809 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:12,809 INFO ]: Start difference. First operand 50 states and 112 transitions. Second operand 3 states. [2018-06-26 18:41:13,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:13,007 INFO ]: Finished difference Result 73 states and 177 transitions. [2018-06-26 18:41:13,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:13,008 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:13,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:13,010 INFO ]: With dead ends: 73 [2018-06-26 18:41:13,010 INFO ]: Without dead ends: 73 [2018-06-26 18:41:13,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-26 18:41:13,011 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 18:41:13,021 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-06-26 18:41:13,021 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:41:13,024 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2018-06-26 18:41:13,024 INFO ]: Start accepts. Automaton has 51 states and 116 transitions. Word has length 6 [2018-06-26 18:41:13,024 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:13,024 INFO ]: Abstraction has 51 states and 116 transitions. [2018-06-26 18:41:13,024 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:13,024 INFO ]: Start isEmpty. Operand 51 states and 116 transitions. [2018-06-26 18:41:13,026 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:13,026 INFO ]: Found error trace [2018-06-26 18:41:13,026 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:13,026 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:13,026 INFO ]: Analyzing trace with hash 1252519436, now seen corresponding path program 1 times [2018-06-26 18:41:13,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:13,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:13,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:13,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:13,114 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:13,114 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:13,114 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:41:13,114 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:41:13,114 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:41:13,114 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:41:13,114 INFO ]: Start difference. First operand 51 states and 116 transitions. Second operand 4 states. [2018-06-26 18:41:13,289 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-26 18:41:13,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:13,585 INFO ]: Finished difference Result 75 states and 179 transitions. [2018-06-26 18:41:13,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:41:13,586 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:41:13,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:13,587 INFO ]: With dead ends: 75 [2018-06-26 18:41:13,587 INFO ]: Without dead ends: 73 [2018-06-26 18:41:13,588 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:13,588 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 18:41:13,596 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-06-26 18:41:13,596 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:41:13,598 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2018-06-26 18:41:13,598 INFO ]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 6 [2018-06-26 18:41:13,598 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:13,598 INFO ]: Abstraction has 51 states and 114 transitions. [2018-06-26 18:41:13,598 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:41:13,598 INFO ]: Start isEmpty. Operand 51 states and 114 transitions. [2018-06-26 18:41:13,599 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:13,599 INFO ]: Found error trace [2018-06-26 18:41:13,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:13,599 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:13,599 INFO ]: Analyzing trace with hash 1247872040, now seen corresponding path program 1 times [2018-06-26 18:41:13,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:13,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:13,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:13,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,605 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:13,664 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:13,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:13,664 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:13,665 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:13,665 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:13,665 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:13,665 INFO ]: Start difference. First operand 51 states and 114 transitions. Second operand 3 states. [2018-06-26 18:41:13,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:13,928 INFO ]: Finished difference Result 74 states and 165 transitions. [2018-06-26 18:41:13,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:13,929 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:13,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:13,930 INFO ]: With dead ends: 74 [2018-06-26 18:41:13,931 INFO ]: Without dead ends: 74 [2018-06-26 18:41:13,931 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-26 18:41:13,931 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 18:41:13,938 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-26 18:41:13,938 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 18:41:13,940 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 165 transitions. [2018-06-26 18:41:13,940 INFO ]: Start accepts. Automaton has 74 states and 165 transitions. Word has length 6 [2018-06-26 18:41:13,940 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:13,940 INFO ]: Abstraction has 74 states and 165 transitions. [2018-06-26 18:41:13,940 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:13,940 INFO ]: Start isEmpty. Operand 74 states and 165 transitions. [2018-06-26 18:41:13,943 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:41:13,943 INFO ]: Found error trace [2018-06-26 18:41:13,943 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:13,943 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:13,943 INFO ]: Analyzing trace with hash -468227323, now seen corresponding path program 1 times [2018-06-26 18:41:13,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:13,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:13,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:13,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:13,951 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:13,994 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:13,994 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:13,994 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:13,994 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:13,994 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:13,994 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:13,994 INFO ]: Start difference. First operand 74 states and 165 transitions. Second operand 3 states. [2018-06-26 18:41:14,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:14,120 INFO ]: Finished difference Result 97 states and 209 transitions. [2018-06-26 18:41:14,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:14,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 18:41:14,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:14,123 INFO ]: With dead ends: 97 [2018-06-26 18:41:14,123 INFO ]: Without dead ends: 97 [2018-06-26 18:41:14,123 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-26 18:41:14,123 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 18:41:14,132 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-06-26 18:41:14,132 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 18:41:14,134 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 209 transitions. [2018-06-26 18:41:14,134 INFO ]: Start accepts. Automaton has 97 states and 209 transitions. Word has length 11 [2018-06-26 18:41:14,134 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:14,134 INFO ]: Abstraction has 97 states and 209 transitions. [2018-06-26 18:41:14,134 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:14,134 INFO ]: Start isEmpty. Operand 97 states and 209 transitions. [2018-06-26 18:41:14,137 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:14,137 INFO ]: Found error trace [2018-06-26 18:41:14,137 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:14,137 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:14,137 INFO ]: Analyzing trace with hash 1276118764, now seen corresponding path program 1 times [2018-06-26 18:41:14,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:14,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:14,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:14,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:14,207 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:14,207 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:14,207 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:14,208 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:14,208 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:14,208 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:14,208 INFO ]: Start difference. First operand 97 states and 209 transitions. Second operand 3 states. [2018-06-26 18:41:14,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:14,512 INFO ]: Finished difference Result 120 states and 257 transitions. [2018-06-26 18:41:14,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:14,512 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:41:14,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:14,514 INFO ]: With dead ends: 120 [2018-06-26 18:41:14,514 INFO ]: Without dead ends: 120 [2018-06-26 18:41:14,515 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-26 18:41:14,515 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-26 18:41:14,524 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-26 18:41:14,524 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-26 18:41:14,526 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 257 transitions. [2018-06-26 18:41:14,526 INFO ]: Start accepts. Automaton has 120 states and 257 transitions. Word has length 12 [2018-06-26 18:41:14,526 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:14,526 INFO ]: Abstraction has 120 states and 257 transitions. [2018-06-26 18:41:14,526 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:14,526 INFO ]: Start isEmpty. Operand 120 states and 257 transitions. [2018-06-26 18:41:14,530 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:14,530 INFO ]: Found error trace [2018-06-26 18:41:14,530 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:14,530 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:14,530 INFO ]: Analyzing trace with hash 1125837257, now seen corresponding path program 1 times [2018-06-26 18:41:14,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:14,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:14,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:14,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,540 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:14,595 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:14,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:14,595 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-26 18:41:14,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:14,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:14,654 INFO ]: Computing forward predicates... [2018-06-26 18:41:14,685 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:14,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:14,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:41:14,722 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:41:14,722 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:41:14,723 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:41:14,723 INFO ]: Start difference. First operand 120 states and 257 transitions. Second operand 4 states. [2018-06-26 18:41:14,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:14,837 INFO ]: Finished difference Result 155 states and 394 transitions. [2018-06-26 18:41:14,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:41:14,839 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-26 18:41:14,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:14,842 INFO ]: With dead ends: 155 [2018-06-26 18:41:14,842 INFO ]: Without dead ends: 155 [2018-06-26 18:41:14,842 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:14,843 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-26 18:41:14,861 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 140. [2018-06-26 18:41:14,861 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-26 18:41:14,863 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 302 transitions. [2018-06-26 18:41:14,863 INFO ]: Start accepts. Automaton has 140 states and 302 transitions. Word has length 12 [2018-06-26 18:41:14,863 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:14,863 INFO ]: Abstraction has 140 states and 302 transitions. [2018-06-26 18:41:14,863 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:41:14,863 INFO ]: Start isEmpty. Operand 140 states and 302 transitions. [2018-06-26 18:41:14,867 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:14,867 INFO ]: Found error trace [2018-06-26 18:41:14,867 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:14,868 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:14,868 INFO ]: Analyzing trace with hash 1125838218, now seen corresponding path program 1 times [2018-06-26 18:41:14,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:14,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:14,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:14,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:14,877 INFO ]: Conjunction of SSA is sat [2018-06-26 18:41:14,879 INFO ]: Counterexample might be feasible [2018-06-26 18:41:14,892 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:41:14,893 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:41:14 BasicIcfg [2018-06-26 18:41:14,893 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:41:14,894 INFO ]: Toolchain (without parser) took 4244.34 ms. Allocated memory was 305.1 MB in the beginning and 326.1 MB in the end (delta: 21.0 MB). Free memory was 257.3 MB in the beginning and 202.8 MB in the end (delta: 54.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,899 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:41:14,899 INFO ]: ChcToBoogie took 56.62 ms. Allocated memory is still 305.1 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,900 INFO ]: Boogie Preprocessor took 40.25 ms. Allocated memory is still 305.1 MB. Free memory was 255.3 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,900 INFO ]: RCFGBuilder took 535.14 ms. Allocated memory is still 305.1 MB. Free memory was 253.4 MB in the beginning and 234.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,901 INFO ]: BlockEncodingV2 took 153.05 ms. Allocated memory is still 305.1 MB. Free memory was 234.4 MB in the beginning and 227.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,902 INFO ]: TraceAbstraction took 3448.75 ms. Allocated memory was 305.1 MB in the beginning and 326.1 MB in the end (delta: 21.0 MB). Free memory was 227.4 MB in the beginning and 202.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:41:14,905 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 69 edges - StatisticsResult: Encoded RCFG 25 locations, 57 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.62 ms. Allocated memory is still 305.1 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory is still 305.1 MB. Free memory was 255.3 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 535.14 ms. Allocated memory is still 305.1 MB. Free memory was 253.4 MB in the beginning and 234.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 153.05 ms. Allocated memory is still 305.1 MB. Free memory was 234.4 MB in the beginning and 227.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3448.75 ms. Allocated memory was 305.1 MB in the beginning and 326.1 MB in the end (delta: 21.0 MB). Free memory was 227.4 MB in the beginning and 202.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assume (((!(hbv_False_5_Int == hbv_False_4_Int) && hbv_False_2_Int == 2) && hbv_False_3_Int == hbv_False_4_Int) && !(hbv_False_1_Int == 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := hbv_False_1_Int - 1, hbv_False_3_Int + 1, hbv_False_5_Int; [L0] havoc hbv_False_1_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_2_Int; [L0] assume !(hhv_INV_REC_f__1_0_Int == 0); [L0] CALL call gotoProc(3, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int; [L0] assume hhv_INV_REC_f__1_0_Int == 0 && hhv_INV_REC_f__1_2_Int == hhv_INV_REC_f__1_1_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 744 SDtfs, 215 SDslu, 601 SDs, 0 SdLazy, 230 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=10, 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, 10 MinimizatonAttempts, 91 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 1102 SizeOfPredicates, 4 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-41-14-917.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-41-14-917.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-41-14-917.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-41-14-917.csv Received shutdown request...