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/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:20:45,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:20:45,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:20:45,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:20:45,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:20:45,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:20:45,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:20:45,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:20:45,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:20:45,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:20:45,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:20:45,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:20:45,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:20:45,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:20:45,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:20:45,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:20:45,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:20:45,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:20:45,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:20:45,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:20:45,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:20:45,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:20:45,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:20:45,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:20:45,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:20:45,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:20:45,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:20:45,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:20:45,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:20:45,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:20:45,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:20:45,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:20:45,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:20:45,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:20:45,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:20:45,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:20:45,788 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:20:45,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:20:45,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:20:45,816 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:20:45,816 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:20:45,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:20:45,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:20:45,817 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:20:45,818 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:20:45,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:20:45,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:20:45,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:20:45,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:20:45,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:20:45,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:20:45,819 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:20:45,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:20:45,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:20:45,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:20:45,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:20:45,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:20:45,823 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:20:45,824 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:20:45,824 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:20:45,873 INFO ]: Repository-Root is: /tmp [2018-06-26 17:20:45,890 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:20:45,895 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:20:45,896 INFO ]: Initializing SmtParser... [2018-06-26 17:20:45,896 INFO ]: SmtParser initialized [2018-06-26 17:20:45,897 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-26 17:20:45,898 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 17:20:45,984 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 unknown [2018-06-26 17:20:46,465 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-26 17:20:46,472 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:20:46,478 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:20:46,478 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:20:46,478 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:20:46,478 INFO ]: ChcToBoogie initialized [2018-06-26 17:20:46,482 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,569 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46 Unit [2018-06-26 17:20:46,569 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:20:46,569 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:20:46,569 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:20:46,570 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:20:46,583 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,584 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,593 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,594 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,612 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,616 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,619 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (1/1) ... [2018-06-26 17:20:46,624 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:20:46,624 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:20:46,624 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:20:46,624 INFO ]: RCFGBuilder initialized [2018-06-26 17:20:46,625 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (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-26 17:20:46,637 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:20:46,637 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:20:46,637 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:20:46,637 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:20:46,637 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:20:46,637 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 17:20:48,111 INFO ]: Using library mode [2018-06-26 17:20:48,112 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:20:48 BoogieIcfgContainer [2018-06-26 17:20:48,112 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:20:48,112 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:20:48,112 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:20:48,113 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:20:48,114 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:20:48" (1/1) ... [2018-06-26 17:20:48,160 INFO ]: Initial Icfg 145 locations, 284 edges [2018-06-26 17:20:48,161 INFO ]: Using Remove infeasible edges [2018-06-26 17:20:48,162 INFO ]: Using Maximize final states [2018-06-26 17:20:48,163 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:20:48,163 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:20:48,165 INFO ]: Using Remove sink states [2018-06-26 17:20:48,165 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:20:48,166 INFO ]: Using Use SBE [2018-06-26 17:20:48,187 INFO ]: SBE split 0 edges [2018-06-26 17:20:48,198 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:20:48,204 INFO ]: 0 new accepting states [2018-06-26 17:20:48,890 INFO ]: Removed 64 edges and 9 locations by large block encoding [2018-06-26 17:20:48,892 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:20:48,895 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:20:48,895 INFO ]: 0 new accepting states [2018-06-26 17:20:48,898 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:20:48,899 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:20:48,900 INFO ]: Encoded RCFG 133 locations, 271 edges [2018-06-26 17:20:48,901 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:20:48 BasicIcfg [2018-06-26 17:20:48,901 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:20:48,902 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:20:48,902 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:20:48,905 INFO ]: TraceAbstraction initialized [2018-06-26 17:20:48,905 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:20:46" (1/4) ... [2018-06-26 17:20:48,906 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4b9ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:20:48, skipping insertion in model container [2018-06-26 17:20:48,906 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:20:46" (2/4) ... [2018-06-26 17:20:48,906 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4b9ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:20:48, skipping insertion in model container [2018-06-26 17:20:48,906 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:20:48" (3/4) ... [2018-06-26 17:20:48,907 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4b9ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:20:48, skipping insertion in model container [2018-06-26 17:20:48,907 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:20:48" (4/4) ... [2018-06-26 17:20:48,914 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:20:48,921 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:20:48,935 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:20:48,985 INFO ]: Using default assertion order modulation [2018-06-26 17:20:48,986 INFO ]: Interprodecural is true [2018-06-26 17:20:48,986 INFO ]: Hoare is false [2018-06-26 17:20:48,986 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:20:48,986 INFO ]: Backedges is TWOTRACK [2018-06-26 17:20:48,986 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:20:48,986 INFO ]: Difference is false [2018-06-26 17:20:48,986 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:20:48,986 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:20:49,002 INFO ]: Start isEmpty. Operand 133 states. [2018-06-26 17:20:49,036 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:20:49,036 INFO ]: Found error trace [2018-06-26 17:20:49,037 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:20:49,037 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:49,042 INFO ]: Analyzing trace with hash 5798289, now seen corresponding path program 1 times [2018-06-26 17:20:49,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:49,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:49,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:49,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:49,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:49,140 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:49,238 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:20:49,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:49,239 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:20:49,241 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:20:49,253 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:20:49,254 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:20:49,259 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-26 17:20:51,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:20:51,463 INFO ]: Finished difference Result 263 states and 538 transitions. [2018-06-26 17:20:51,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:20:51,467 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:20:51,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:20:51,510 INFO ]: With dead ends: 263 [2018-06-26 17:20:51,510 INFO ]: Without dead ends: 263 [2018-06-26 17:20:51,512 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 17:20:51,531 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-26 17:20:51,649 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-06-26 17:20:51,650 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-26 17:20:51,670 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 538 transitions. [2018-06-26 17:20:51,672 INFO ]: Start accepts. Automaton has 263 states and 538 transitions. Word has length 4 [2018-06-26 17:20:51,673 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:20:51,673 INFO ]: Abstraction has 263 states and 538 transitions. [2018-06-26 17:20:51,673 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:20:51,673 INFO ]: Start isEmpty. Operand 263 states and 538 transitions. [2018-06-26 17:20:51,677 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:20:51,677 INFO ]: Found error trace [2018-06-26 17:20:51,677 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:20:51,677 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:51,679 INFO ]: Analyzing trace with hash 5799250, now seen corresponding path program 1 times [2018-06-26 17:20:51,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:51,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:51,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:51,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:51,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:51,698 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:51,751 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:20:51,751 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:51,752 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:20:51,753 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:20:51,753 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:20:51,753 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:20:51,753 INFO ]: Start difference. First operand 263 states and 538 transitions. Second operand 3 states. [2018-06-26 17:20:52,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:20:52,899 INFO ]: Finished difference Result 393 states and 806 transitions. [2018-06-26 17:20:52,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:20:52,900 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:20:52,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:20:52,913 INFO ]: With dead ends: 393 [2018-06-26 17:20:52,914 INFO ]: Without dead ends: 393 [2018-06-26 17:20:52,914 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 17:20:52,915 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-26 17:20:53,004 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-06-26 17:20:53,004 INFO ]: Start removeUnreachable. Operand 393 states. [2018-06-26 17:20:53,015 INFO ]: Finished removeUnreachable. Reduced from 393 states to 393 states and 806 transitions. [2018-06-26 17:20:53,015 INFO ]: Start accepts. Automaton has 393 states and 806 transitions. Word has length 4 [2018-06-26 17:20:53,015 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:20:53,015 INFO ]: Abstraction has 393 states and 806 transitions. [2018-06-26 17:20:53,015 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:20:53,015 INFO ]: Start isEmpty. Operand 393 states and 806 transitions. [2018-06-26 17:20:53,051 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:20:53,051 INFO ]: Found error trace [2018-06-26 17:20:53,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:20:53,052 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:53,052 INFO ]: Analyzing trace with hash -1025247620, now seen corresponding path program 1 times [2018-06-26 17:20:53,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:53,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:53,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:53,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:53,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:53,072 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:53,109 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:20:53,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:53,109 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:20:53,110 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:20:53,110 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:20:53,110 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:20:53,110 INFO ]: Start difference. First operand 393 states and 806 transitions. Second operand 3 states. [2018-06-26 17:20:54,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:20:54,149 INFO ]: Finished difference Result 523 states and 1067 transitions. [2018-06-26 17:20:54,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:20:54,149 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:20:54,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:20:54,168 INFO ]: With dead ends: 523 [2018-06-26 17:20:54,168 INFO ]: Without dead ends: 523 [2018-06-26 17:20:54,168 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 17:20:54,169 INFO ]: Start minimizeSevpa. Operand 523 states. [2018-06-26 17:20:54,263 INFO ]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-06-26 17:20:54,263 INFO ]: Start removeUnreachable. Operand 523 states. [2018-06-26 17:20:54,277 INFO ]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1067 transitions. [2018-06-26 17:20:54,277 INFO ]: Start accepts. Automaton has 523 states and 1067 transitions. Word has length 9 [2018-06-26 17:20:54,277 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:20:54,277 INFO ]: Abstraction has 523 states and 1067 transitions. [2018-06-26 17:20:54,277 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:20:54,278 INFO ]: Start isEmpty. Operand 523 states and 1067 transitions. [2018-06-26 17:20:54,297 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:20:54,297 INFO ]: Found error trace [2018-06-26 17:20:54,297 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:20:54,297 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:54,297 INFO ]: Analyzing trace with hash 1652236957, now seen corresponding path program 1 times [2018-06-26 17:20:54,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:54,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:54,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:54,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:54,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:54,336 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:54,405 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:20:54,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:54,405 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:20:54,405 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:20:54,405 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:20:54,405 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:20:54,405 INFO ]: Start difference. First operand 523 states and 1067 transitions. Second operand 5 states. [2018-06-26 17:20:55,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:20:55,656 INFO ]: Finished difference Result 817 states and 2256 transitions. [2018-06-26 17:20:55,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:20:55,659 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:20:55,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:20:55,718 INFO ]: With dead ends: 817 [2018-06-26 17:20:55,718 INFO ]: Without dead ends: 817 [2018-06-26 17:20:55,718 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:20:55,719 INFO ]: Start minimizeSevpa. Operand 817 states. [2018-06-26 17:20:55,906 INFO ]: Finished minimizeSevpa. Reduced states from 817 to 532. [2018-06-26 17:20:55,906 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-26 17:20:55,918 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1131 transitions. [2018-06-26 17:20:55,918 INFO ]: Start accepts. Automaton has 532 states and 1131 transitions. Word has length 9 [2018-06-26 17:20:55,919 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:20:55,919 INFO ]: Abstraction has 532 states and 1131 transitions. [2018-06-26 17:20:55,919 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:20:55,919 INFO ]: Start isEmpty. Operand 532 states and 1131 transitions. [2018-06-26 17:20:55,937 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:20:55,937 INFO ]: Found error trace [2018-06-26 17:20:55,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:20:55,937 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:55,937 INFO ]: Analyzing trace with hash 1652227347, now seen corresponding path program 1 times [2018-06-26 17:20:55,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:55,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:55,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:55,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:55,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:55,973 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:56,242 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:20:56,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:56,242 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:20:56,242 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:20:56,242 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:20:56,242 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:20:56,242 INFO ]: Start difference. First operand 532 states and 1131 transitions. Second operand 5 states. [2018-06-26 17:20:58,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:20:58,354 INFO ]: Finished difference Result 817 states and 2240 transitions. [2018-06-26 17:20:58,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:20:58,354 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:20:58,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:20:58,404 INFO ]: With dead ends: 817 [2018-06-26 17:20:58,404 INFO ]: Without dead ends: 817 [2018-06-26 17:20:58,404 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:20:58,404 INFO ]: Start minimizeSevpa. Operand 817 states. [2018-06-26 17:20:58,611 INFO ]: Finished minimizeSevpa. Reduced states from 817 to 532. [2018-06-26 17:20:58,611 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-26 17:20:58,620 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1115 transitions. [2018-06-26 17:20:58,621 INFO ]: Start accepts. Automaton has 532 states and 1115 transitions. Word has length 9 [2018-06-26 17:20:58,621 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:20:58,621 INFO ]: Abstraction has 532 states and 1115 transitions. [2018-06-26 17:20:58,621 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:20:58,621 INFO ]: Start isEmpty. Operand 532 states and 1115 transitions. [2018-06-26 17:20:58,642 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:20:58,642 INFO ]: Found error trace [2018-06-26 17:20:58,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:20:58,642 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:20:58,642 INFO ]: Analyzing trace with hash -1228790447, now seen corresponding path program 1 times [2018-06-26 17:20:58,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:20:58,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:20:58,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:58,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:20:58,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:20:58,656 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:20:58,803 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:20:58,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:20:58,803 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:20:58,804 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:20:58,804 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:20:58,804 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:20:58,804 INFO ]: Start difference. First operand 532 states and 1115 transitions. Second operand 5 states. [2018-06-26 17:21:00,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:21:00,403 INFO ]: Finished difference Result 1025 states and 2885 transitions. [2018-06-26 17:21:00,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:21:00,404 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:21:00,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:21:00,464 INFO ]: With dead ends: 1025 [2018-06-26 17:21:00,464 INFO ]: Without dead ends: 1025 [2018-06-26 17:21:00,464 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:21:00,465 INFO ]: Start minimizeSevpa. Operand 1025 states. [2018-06-26 17:21:00,645 INFO ]: Finished minimizeSevpa. Reduced states from 1025 to 795. [2018-06-26 17:21:00,645 INFO ]: Start removeUnreachable. Operand 795 states. [2018-06-26 17:21:00,662 INFO ]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1684 transitions. [2018-06-26 17:21:00,662 INFO ]: Start accepts. Automaton has 795 states and 1684 transitions. Word has length 9 [2018-06-26 17:21:00,662 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:21:00,662 INFO ]: Abstraction has 795 states and 1684 transitions. [2018-06-26 17:21:00,662 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:21:00,662 INFO ]: Start isEmpty. Operand 795 states and 1684 transitions. [2018-06-26 17:21:00,699 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:21:00,699 INFO ]: Found error trace [2018-06-26 17:21:00,699 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:21:00,699 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:21:00,699 INFO ]: Analyzing trace with hash 1347007583, now seen corresponding path program 1 times [2018-06-26 17:21:00,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:21:00,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:21:00,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:00,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:21:00,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:00,725 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:21:00,925 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:21:00,925 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:21:00,968 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:21:00,968 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:21:00,968 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:21:00,968 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:21:00,968 INFO ]: Start difference. First operand 795 states and 1684 transitions. Second operand 6 states. [2018-06-26 17:21:06,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:21:06,514 INFO ]: Finished difference Result 1932 states and 8199 transitions. [2018-06-26 17:21:06,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:21:06,517 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:21:06,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:21:06,695 INFO ]: With dead ends: 1932 [2018-06-26 17:21:06,695 INFO ]: Without dead ends: 1932 [2018-06-26 17:21:06,695 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:21:06,696 INFO ]: Start minimizeSevpa. Operand 1932 states. [2018-06-26 17:21:07,369 INFO ]: Finished minimizeSevpa. Reduced states from 1932 to 1283. [2018-06-26 17:21:07,369 INFO ]: Start removeUnreachable. Operand 1283 states. [2018-06-26 17:21:07,416 INFO ]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 3649 transitions. [2018-06-26 17:21:07,416 INFO ]: Start accepts. Automaton has 1283 states and 3649 transitions. Word has length 10 [2018-06-26 17:21:07,416 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:21:07,416 INFO ]: Abstraction has 1283 states and 3649 transitions. [2018-06-26 17:21:07,416 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:21:07,416 INFO ]: Start isEmpty. Operand 1283 states and 3649 transitions. [2018-06-26 17:21:07,462 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:21:07,462 INFO ]: Found error trace [2018-06-26 17:21:07,463 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:21:07,463 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:21:07,463 INFO ]: Analyzing trace with hash 1060716073, now seen corresponding path program 1 times [2018-06-26 17:21:07,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:21:07,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:21:07,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:07,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:21:07,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:07,474 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:21:07,865 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:21:07,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:21:07,865 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:21:07,866 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:21:07,866 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:21:07,866 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:21:07,866 INFO ]: Start difference. First operand 1283 states and 3649 transitions. Second operand 6 states. [2018-06-26 17:21:12,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:21:12,802 INFO ]: Finished difference Result 3196 states and 15536 transitions. [2018-06-26 17:21:12,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:21:12,803 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:21:12,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:21:13,245 INFO ]: With dead ends: 3196 [2018-06-26 17:21:13,245 INFO ]: Without dead ends: 3196 [2018-06-26 17:21:13,245 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:21:13,246 INFO ]: Start minimizeSevpa. Operand 3196 states. [2018-06-26 17:21:14,433 INFO ]: Finished minimizeSevpa. Reduced states from 3196 to 2163. [2018-06-26 17:21:14,433 INFO ]: Start removeUnreachable. Operand 2163 states. [2018-06-26 17:21:14,559 INFO ]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 7503 transitions. [2018-06-26 17:21:14,559 INFO ]: Start accepts. Automaton has 2163 states and 7503 transitions. Word has length 10 [2018-06-26 17:21:14,559 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:21:14,559 INFO ]: Abstraction has 2163 states and 7503 transitions. [2018-06-26 17:21:14,559 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:21:14,559 INFO ]: Start isEmpty. Operand 2163 states and 7503 transitions. [2018-06-26 17:21:14,605 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:21:14,605 INFO ]: Found error trace [2018-06-26 17:21:14,605 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:21:14,605 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:21:14,614 INFO ]: Analyzing trace with hash 1117974375, now seen corresponding path program 1 times [2018-06-26 17:21:14,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:21:14,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:21:14,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:14,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:21:14,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:14,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:21:15,021 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:21:15,021 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:21:15,021 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:21:15,021 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:21:15,021 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:21:15,021 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:21:15,021 INFO ]: Start difference. First operand 2163 states and 7503 transitions. Second operand 6 states. [2018-06-26 17:21:20,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:21:20,454 INFO ]: Finished difference Result 5184 states and 28429 transitions. [2018-06-26 17:21:20,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:21:20,454 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:21:20,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:21:22,492 INFO ]: With dead ends: 5184 [2018-06-26 17:21:22,492 INFO ]: Without dead ends: 5184 [2018-06-26 17:21:22,492 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:21:22,494 INFO ]: Start minimizeSevpa. Operand 5184 states. [2018-06-26 17:21:24,267 INFO ]: Finished minimizeSevpa. Reduced states from 5184 to 3792. [2018-06-26 17:21:24,267 INFO ]: Start removeUnreachable. Operand 3792 states. [2018-06-26 17:21:24,447 INFO ]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 14589 transitions. [2018-06-26 17:21:24,447 INFO ]: Start accepts. Automaton has 3792 states and 14589 transitions. Word has length 10 [2018-06-26 17:21:24,447 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:21:24,447 INFO ]: Abstraction has 3792 states and 14589 transitions. [2018-06-26 17:21:24,447 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:21:24,447 INFO ]: Start isEmpty. Operand 3792 states and 14589 transitions. [2018-06-26 17:21:24,487 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:21:24,487 INFO ]: Found error trace [2018-06-26 17:21:24,487 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:21:24,487 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:21:24,489 INFO ]: Analyzing trace with hash -1316098106, now seen corresponding path program 1 times [2018-06-26 17:21:24,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:21:24,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:21:24,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:24,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:21:24,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:24,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:21:24,561 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:21:24,562 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:21:24,562 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:21:24,562 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:21:24,562 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:21:24,562 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:21:24,562 INFO ]: Start difference. First operand 3792 states and 14589 transitions. Second operand 3 states. [2018-06-26 17:21:25,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:21:25,533 INFO ]: Finished difference Result 4811 states and 17657 transitions. [2018-06-26 17:21:25,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:21:25,533 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 17:21:25,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:21:26,065 INFO ]: With dead ends: 4811 [2018-06-26 17:21:26,065 INFO ]: Without dead ends: 4811 [2018-06-26 17:21:26,066 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 17:21:26,068 INFO ]: Start minimizeSevpa. Operand 4811 states. [2018-06-26 17:21:27,676 INFO ]: Finished minimizeSevpa. Reduced states from 4811 to 4267. [2018-06-26 17:21:27,676 INFO ]: Start removeUnreachable. Operand 4267 states. [2018-06-26 17:21:28,155 INFO ]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 15868 transitions. [2018-06-26 17:21:28,155 INFO ]: Start accepts. Automaton has 4267 states and 15868 transitions. Word has length 10 [2018-06-26 17:21:28,155 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:21:28,156 INFO ]: Abstraction has 4267 states and 15868 transitions. [2018-06-26 17:21:28,156 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:21:28,156 INFO ]: Start isEmpty. Operand 4267 states and 15868 transitions. [2018-06-26 17:21:28,199 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:21:28,199 INFO ]: Found error trace [2018-06-26 17:21:28,199 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:21:28,199 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:21:28,199 INFO ]: Analyzing trace with hash -321071990, now seen corresponding path program 1 times [2018-06-26 17:21:28,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:21:28,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:21:28,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:28,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:21:28,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:21:28,218 INFO ]: Conjunction of SSA is sat [2018-06-26 17:21:28,222 INFO ]: Counterexample might be feasible [2018-06-26 17:21:28,235 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:21:28,238 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:21:28 BasicIcfg [2018-06-26 17:21:28,238 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:21:28,239 INFO ]: Toolchain (without parser) took 41766.07 ms. Allocated memory was 305.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 248.5 MB in the beginning and 734.0 MB in the end (delta: -485.4 MB). Peak memory consumption was 838.9 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,240 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:21:28,240 INFO ]: ChcToBoogie took 91.16 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 245.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,244 INFO ]: Boogie Preprocessor took 54.27 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,244 INFO ]: RCFGBuilder took 1487.56 ms. Allocated memory was 305.1 MB in the beginning and 323.0 MB in the end (delta: 17.8 MB). Free memory was 243.5 MB in the beginning and 286.3 MB in the end (delta: -42.7 MB). Peak memory consumption was 66.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,244 INFO ]: BlockEncodingV2 took 788.60 ms. Allocated memory is still 323.0 MB. Free memory was 286.3 MB in the beginning and 247.2 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,245 INFO ]: TraceAbstraction took 39335.74 ms. Allocated memory was 323.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 247.2 MB in the beginning and 734.0 MB in the end (delta: -486.8 MB). Peak memory consumption was 819.8 MB. Max. memory is 3.6 GB. [2018-06-26 17:21:28,251 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 145 locations, 284 edges - StatisticsResult: Encoded RCFG 133 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 91.16 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 245.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.27 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1487.56 ms. Allocated memory was 305.1 MB in the beginning and 323.0 MB in the end (delta: 17.8 MB). Free memory was 243.5 MB in the beginning and 286.3 MB in the end (delta: -42.7 MB). Peak memory consumption was 66.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 788.60 ms. Allocated memory is still 323.0 MB. Free memory was 286.3 MB in the beginning and 247.2 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 39335.74 ms. Allocated memory was 323.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 247.2 MB in the beginning and 734.0 MB in the end (delta: -486.8 MB). Peak memory consumption was 819.8 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, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] RET call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int := hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int; [L0] havoc hbv_False_5_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_11_Int, hbv_False_10_Int, hbv_False_12_Int, hbv_False_1_Int, hbv_False_7_Int, hbv_False_4_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_6_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int := hhv_lturn_0_Int, hhv_lturn_1_Int, hhv_lturn_2_Int, hhv_lturn_3_Int, hhv_lturn_4_Int, hhv_lturn_5_Int, hhv_lturn_6_Int, hhv_lturn_7_Int, hhv_lturn_9_Int, hhv_lturn_10_Int, hhv_lturn_8_Int, hhv_lturn_11_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. UNSAFE Result, 39.2s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6249 SDtfs, 964 SDslu, 10367 SDs, 0 SdLazy, 13098 SolverSat, 3357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4267occurred 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: 7.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 4418 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 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/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-21-28-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-21-28-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-21-28-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-21-28-264.csv Received shutdown request...