java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__loop.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:59:40,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:59:40,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:59:40,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:59:40,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:59:40,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:59:40,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:59:40,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:59:40,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:59:40,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:59:40,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:59:40,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:59:40,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:59:40,778 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:59:40,779 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:59:40,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:59:40,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:59:40,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:59:40,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:59:40,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:59:40,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:59:40,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:59:40,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:59:40,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:59:40,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:59:40,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:59:40,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:59:40,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:59:40,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:59:40,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:59:40,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:59:40,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:59:40,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:59:40,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:59:40,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:59:40,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:59:40,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:59:40,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:59:40,834 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:59:40,834 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:59:40,835 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:59:40,836 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:59:40,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:59:40,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:59:40,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:59:40,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:59:40,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:59:40,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:59:40,838 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:59:40,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:59:40,838 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:59:40,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:59:40,839 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:59:40,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:59:40,839 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:59:40,840 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:59:40,840 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:59:40,879 INFO ]: Repository-Root is: /tmp [2018-06-22 11:59:40,895 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:59:40,899 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:59:40,900 INFO ]: Initializing SmtParser... [2018-06-22 11:59:40,900 INFO ]: SmtParser initialized [2018-06-22 11:59:40,900 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__loop.smt2 [2018-06-22 11:59:40,901 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-22 11:59:40,989 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1bd7ba8 [2018-06-22 11:59:41,151 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop.smt2 [2018-06-22 11:59:41,156 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:59:41,165 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:59:41,166 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:59:41,166 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:59:41,166 INFO ]: ChcToBoogie initialized [2018-06-22 11:59:41,169 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,216 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41 Unit [2018-06-22 11:59:41,216 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:59:41,217 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:59:41,217 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:59:41,217 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:59:41,238 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,238 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,245 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,245 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,247 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,250 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,251 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (1/1) ... [2018-06-22 11:59:41,252 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:59:41,252 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:59:41,252 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:59:41,252 INFO ]: RCFGBuilder initialized [2018-06-22 11:59:41,253 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (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-22 11:59:41,267 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:59:41,267 INFO ]: Found specification of procedure False [2018-06-22 11:59:41,267 INFO ]: Found implementation of procedure False [2018-06-22 11:59:41,267 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:59:41,267 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:59:41,267 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:59:41,267 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:59:41,267 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:59:41,267 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-22 11:59:41,509 INFO ]: Using library mode [2018-06-22 11:59:41,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:41 BoogieIcfgContainer [2018-06-22 11:59:41,513 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:59:41,514 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:59:41,514 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:59:41,528 INFO ]: TraceAbstraction initialized [2018-06-22 11:59:41,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:41" (1/3) ... [2018-06-22 11:59:41,529 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d303731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:59:41, skipping insertion in model container [2018-06-22 11:59:41,529 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:41" (2/3) ... [2018-06-22 11:59:41,529 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d303731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:59:41, skipping insertion in model container [2018-06-22 11:59:41,529 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:41" (3/3) ... [2018-06-22 11:59:41,531 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:59:41,541 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:59:41,558 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:59:41,609 INFO ]: Using default assertion order modulation [2018-06-22 11:59:41,610 INFO ]: Interprodecural is true [2018-06-22 11:59:41,610 INFO ]: Hoare is false [2018-06-22 11:59:41,610 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:59:41,610 INFO ]: Backedges is TWOTRACK [2018-06-22 11:59:41,610 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:59:41,610 INFO ]: Difference is false [2018-06-22 11:59:41,610 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:59:41,610 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:59:41,628 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:59:41,643 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:41,643 INFO ]: Found error trace [2018-06-22 11:59:41,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:41,644 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:41,649 INFO ]: Analyzing trace with hash -911285918, now seen corresponding path program 1 times [2018-06-22 11:59:41,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:41,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:41,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:41,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:41,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:41,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:41,814 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:41,817 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:41,817 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:41,819 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:41,830 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:41,830 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:41,832 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:59:41,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:41,958 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:59:41,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:41,960 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:41,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:41,968 INFO ]: With dead ends: 15 [2018-06-22 11:59:41,968 INFO ]: Without dead ends: 15 [2018-06-22 11:59:41,970 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:41,982 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:59:42,004 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:59:42,006 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:59:42,007 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:59:42,008 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:59:42,009 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,009 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:59:42,009 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:42,009 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:59:42,010 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:42,010 INFO ]: Found error trace [2018-06-22 11:59:42,011 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,011 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,011 INFO ]: Analyzing trace with hash 1546110726, now seen corresponding path program 1 times [2018-06-22 11:59:42,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,127 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:42,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,127 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:42,129 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:42,129 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:42,129 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,129 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 11:59:42,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:42,292 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:59:42,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:42,292 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:42,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:42,293 INFO ]: With dead ends: 19 [2018-06-22 11:59:42,293 INFO ]: Without dead ends: 19 [2018-06-22 11:59:42,294 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,294 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:59:42,301 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:59:42,301 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:59:42,302 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 11:59:42,302 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 13 [2018-06-22 11:59:42,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,303 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 11:59:42,303 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:42,303 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 11:59:42,304 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:42,304 INFO ]: Found error trace [2018-06-22 11:59:42,304 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,304 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,304 INFO ]: Analyzing trace with hash 2036612432, now seen corresponding path program 1 times [2018-06-22 11:59:42,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,363 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:42,363 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,363 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:42,363 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:42,363 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:42,363 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,364 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2018-06-22 11:59:42,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:42,628 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-22 11:59:42,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:42,628 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:42,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:42,629 INFO ]: With dead ends: 19 [2018-06-22 11:59:42,629 INFO ]: Without dead ends: 19 [2018-06-22 11:59:42,630 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:42,630 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:59:42,637 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 11:59:42,637 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:59:42,638 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-22 11:59:42,638 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 13 [2018-06-22 11:59:42,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,638 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-22 11:59:42,638 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:42,638 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-22 11:59:42,639 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:42,639 INFO ]: Found error trace [2018-06-22 11:59:42,639 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,639 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,639 INFO ]: Analyzing trace with hash 1791361579, now seen corresponding path program 1 times [2018-06-22 11:59:42,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,757 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:42,757 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,757 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:42,757 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:42,757 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:42,757 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:42,757 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 5 states. [2018-06-22 11:59:42,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:42,896 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-22 11:59:42,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:42,896 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:59:42,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:42,898 INFO ]: With dead ends: 21 [2018-06-22 11:59:42,898 INFO ]: Without dead ends: 21 [2018-06-22 11:59:42,898 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:42,898 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:59:42,904 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:59:42,904 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:59:42,905 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-22 11:59:42,906 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 13 [2018-06-22 11:59:42,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:42,906 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-22 11:59:42,906 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:42,906 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-22 11:59:42,907 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:42,907 INFO ]: Found error trace [2018-06-22 11:59:42,907 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:42,907 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:42,907 INFO ]: Analyzing trace with hash 430339545, now seen corresponding path program 1 times [2018-06-22 11:59:42,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:42,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:42,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:42,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:42,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:42,972 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:42,972 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:42,972 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:42,973 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:42,973 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:42,973 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:42,973 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 5 states. [2018-06-22 11:59:43,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:43,119 INFO ]: Finished difference Result 19 states and 26 transitions. [2018-06-22 11:59:43,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:43,119 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:43,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:43,120 INFO ]: With dead ends: 19 [2018-06-22 11:59:43,120 INFO ]: Without dead ends: 18 [2018-06-22 11:59:43,120 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:43,121 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 11:59:43,124 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-22 11:59:43,124 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:59:43,125 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 11:59:43,125 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 17 [2018-06-22 11:59:43,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:43,125 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 11:59:43,126 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:43,126 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 11:59:43,127 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:43,127 INFO ]: Found error trace [2018-06-22 11:59:43,127 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:43,127 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:43,127 INFO ]: Analyzing trace with hash -1389374833, now seen corresponding path program 1 times [2018-06-22 11:59:43,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:43,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:43,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:43,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:43,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:43,138 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:43,192 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:43,192 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:43,192 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:43,192 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:43,192 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:43,192 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:43,192 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 5 states. [2018-06-22 11:59:43,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:43,264 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-22 11:59:43,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:43,264 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:43,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:43,264 INFO ]: With dead ends: 10 [2018-06-22 11:59:43,264 INFO ]: Without dead ends: 0 [2018-06-22 11:59:43,264 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:43,264 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:59:43,264 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:59:43,264 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:59:43,264 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:59:43,264 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:59:43,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:43,264 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:59:43,264 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:43,264 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:59:43,264 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:59:43,270 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:43 BoogieIcfgContainer [2018-06-22 11:59:43,270 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:43,271 INFO ]: Toolchain (without parser) took 2114.47 ms. Allocated memory was 305.1 MB in the beginning and 324.0 MB in the end (delta: 18.9 MB). Free memory was 261.5 MB in the beginning and 287.2 MB in the end (delta: -25.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:43,272 INFO ]: SmtParser took 0.05 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-22 11:59:43,273 INFO ]: ChcToBoogie took 50.85 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 259.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:43,273 INFO ]: Boogie Preprocessor took 34.59 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 258.5 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-22 11:59:43,274 INFO ]: RCFGBuilder took 261.26 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 251.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:43,274 INFO ]: TraceAbstraction took 1755.34 ms. Allocated memory was 305.1 MB in the beginning and 324.0 MB in the end (delta: 18.9 MB). Free memory was 250.5 MB in the beginning and 287.2 MB in the end (delta: -36.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:43,278 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 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 50.85 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 259.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.59 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 258.5 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 261.26 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 251.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1755.34 ms. Allocated memory was 305.1 MB in the beginning and 324.0 MB in the end (delta: 18.9 MB). Free memory was 250.5 MB in the beginning and 287.2 MB in the end (delta: -36.7 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 15 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 8 SDslu, 93 SDs, 0 SdLazy, 153 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=4, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__loop.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-43-290.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__loop.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-43-290.csv Received shutdown request...