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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:25:01,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:25:01,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:25:01,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:25:01,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:25:01,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:25:01,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:25:01,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:25:01,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:25:01,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:25:01,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:25:01,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:25:01,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:25:01,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:25:01,966 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:25:01,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:25:01,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:25:01,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:25:01,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:25:01,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:25:01,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:25:01,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:25:01,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:25:01,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:25:01,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:25:01,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:25:01,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:25:01,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:25:01,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:25:01,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:25:01,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:25:01,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:25:01,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:25:01,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:25:01,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:25:01,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:25:02,007 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:25:02,007 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:25:02,007 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:25:02,007 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:25:02,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:25:02,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:25:02,012 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:25:02,012 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:25:02,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:25:02,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:25:02,012 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:25:02,013 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:25:02,016 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:25:02,016 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:25:02,071 INFO ]: Repository-Root is: /tmp [2018-06-22 01:25:02,087 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:25:02,092 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:25:02,094 INFO ]: Initializing SmtParser... [2018-06-22 01:25:02,094 INFO ]: SmtParser initialized [2018-06-22 01:25:02,095 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 [2018-06-22 01:25:02,096 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 01:25:02,187 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 unknown [2018-06-22 01:25:02,917 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 [2018-06-22 01:25:02,922 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:25:02,929 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:25:02,929 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:25:02,929 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:25:02,930 INFO ]: ChcToBoogie initialized [2018-06-22 01:25:02,933 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:25:02" (1/1) ... [2018-06-22 01:25:03,021 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03 Unit [2018-06-22 01:25:03,021 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:25:03,022 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:25:03,022 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:25:03,022 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:25:03,042 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,043 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,070 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,070 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,094 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,097 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,103 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (1/1) ... [2018-06-22 01:25:03,108 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:25:03,109 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:25:03,109 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:25:03,109 INFO ]: RCFGBuilder initialized [2018-06-22 01:25:03,109 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (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 01:25:03,119 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:25:03,119 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:25:03,119 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:25:03,119 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:25:03,119 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:25:03,119 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 01:25:04,149 INFO ]: Using library mode [2018-06-22 01:25:04,150 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:25:04 BoogieIcfgContainer [2018-06-22 01:25:04,150 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:25:04,151 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:25:04,151 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:25:04,156 INFO ]: TraceAbstraction initialized [2018-06-22 01:25:04,156 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:25:02" (1/3) ... [2018-06-22 01:25:04,157 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f983cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:25:04, skipping insertion in model container [2018-06-22 01:25:04,157 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:25:03" (2/3) ... [2018-06-22 01:25:04,157 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f983cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:25:04, skipping insertion in model container [2018-06-22 01:25:04,157 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:25:04" (3/3) ... [2018-06-22 01:25:04,160 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:25:04,169 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:25:04,178 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:25:04,221 INFO ]: Using default assertion order modulation [2018-06-22 01:25:04,222 INFO ]: Interprodecural is true [2018-06-22 01:25:04,222 INFO ]: Hoare is false [2018-06-22 01:25:04,222 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:25:04,222 INFO ]: Backedges is TWOTRACK [2018-06-22 01:25:04,222 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:25:04,222 INFO ]: Difference is false [2018-06-22 01:25:04,222 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:25:04,222 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:25:04,240 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:25:04,253 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:25:04,253 INFO ]: Found error trace [2018-06-22 01:25:04,256 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:04,256 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:04,261 INFO ]: Analyzing trace with hash 1902700542, now seen corresponding path program 1 times [2018-06-22 01:25:04,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:04,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:04,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:04,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:04,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:04,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:04,462 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:04,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:04,465 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:04,467 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:04,482 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:04,482 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:04,486 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:25:05,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:05,142 INFO ]: Finished difference Result 9 states and 65 transitions. [2018-06-22 01:25:05,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:05,146 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:25:05,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:05,158 INFO ]: With dead ends: 9 [2018-06-22 01:25:05,158 INFO ]: Without dead ends: 9 [2018-06-22 01:25:05,163 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-22 01:25:05,177 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:25:05,209 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:25:05,210 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:25:05,211 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-06-22 01:25:05,212 INFO ]: Start accepts. Automaton has 9 states and 65 transitions. Word has length 7 [2018-06-22 01:25:05,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:05,214 INFO ]: Abstraction has 9 states and 65 transitions. [2018-06-22 01:25:05,214 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:05,214 INFO ]: Start isEmpty. Operand 9 states and 65 transitions. [2018-06-22 01:25:05,215 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:05,215 INFO ]: Found error trace [2018-06-22 01:25:05,215 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:05,215 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:05,215 INFO ]: Analyzing trace with hash -1137668127, now seen corresponding path program 1 times [2018-06-22 01:25:05,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:05,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:05,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:05,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:05,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:05,304 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:05,479 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:05,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:25:05,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:25:05,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:05,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:05,541 INFO ]: Computing forward predicates... [2018-06-22 01:25:05,649 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:05,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:05,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:25:05,684 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:25:05,684 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:25:05,684 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:25:05,684 INFO ]: Start difference. First operand 9 states and 65 transitions. Second operand 4 states. [2018-06-22 01:25:06,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:06,553 INFO ]: Finished difference Result 11 states and 123 transitions. [2018-06-22 01:25:06,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:25:06,553 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:25:06,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:06,554 INFO ]: With dead ends: 11 [2018-06-22 01:25:06,554 INFO ]: Without dead ends: 11 [2018-06-22 01:25:06,555 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:25:06,555 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:25:06,557 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:25:06,557 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:25:06,558 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2018-06-22 01:25:06,558 INFO ]: Start accepts. Automaton has 11 states and 123 transitions. Word has length 8 [2018-06-22 01:25:06,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:06,559 INFO ]: Abstraction has 11 states and 123 transitions. [2018-06-22 01:25:06,559 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:25:06,559 INFO ]: Start isEmpty. Operand 11 states and 123 transitions. [2018-06-22 01:25:06,559 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:06,559 INFO ]: Found error trace [2018-06-22 01:25:06,559 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:06,559 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:06,559 INFO ]: Analyzing trace with hash -1126585875, now seen corresponding path program 1 times [2018-06-22 01:25:06,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:06,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:06,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:06,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:06,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:06,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:06,636 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:06,636 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:06,636 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:06,636 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:06,636 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:06,636 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:06,636 INFO ]: Start difference. First operand 11 states and 123 transitions. Second operand 3 states. [2018-06-22 01:25:06,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:06,885 INFO ]: Finished difference Result 15 states and 191 transitions. [2018-06-22 01:25:06,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:06,885 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:25:06,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:06,886 INFO ]: With dead ends: 15 [2018-06-22 01:25:06,886 INFO ]: Without dead ends: 15 [2018-06-22 01:25:06,887 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-22 01:25:06,887 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:25:06,890 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:25:06,890 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:25:06,891 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2018-06-22 01:25:06,891 INFO ]: Start accepts. Automaton has 13 states and 157 transitions. Word has length 8 [2018-06-22 01:25:06,892 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:06,892 INFO ]: Abstraction has 13 states and 157 transitions. [2018-06-22 01:25:06,892 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:06,892 INFO ]: Start isEmpty. Operand 13 states and 157 transitions. [2018-06-22 01:25:06,892 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:06,892 INFO ]: Found error trace [2018-06-22 01:25:06,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:06,892 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:06,892 INFO ]: Analyzing trace with hash -1122891791, now seen corresponding path program 1 times [2018-06-22 01:25:06,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:06,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:06,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:06,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:06,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:06,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:06,953 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:06,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:06,953 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:06,953 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:06,953 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:06,953 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:06,953 INFO ]: Start difference. First operand 13 states and 157 transitions. Second operand 3 states. [2018-06-22 01:25:07,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:07,159 INFO ]: Finished difference Result 15 states and 199 transitions. [2018-06-22 01:25:07,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:07,162 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:25:07,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:07,163 INFO ]: With dead ends: 15 [2018-06-22 01:25:07,163 INFO ]: Without dead ends: 15 [2018-06-22 01:25:07,163 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-22 01:25:07,163 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:25:07,169 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:25:07,169 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:25:07,170 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 178 transitions. [2018-06-22 01:25:07,170 INFO ]: Start accepts. Automaton has 14 states and 178 transitions. Word has length 8 [2018-06-22 01:25:07,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:07,170 INFO ]: Abstraction has 14 states and 178 transitions. [2018-06-22 01:25:07,170 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:07,170 INFO ]: Start isEmpty. Operand 14 states and 178 transitions. [2018-06-22 01:25:07,171 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:07,171 INFO ]: Found error trace [2018-06-22 01:25:07,171 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:07,171 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:07,171 INFO ]: Analyzing trace with hash -1177379530, now seen corresponding path program 1 times [2018-06-22 01:25:07,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:07,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:07,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:07,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:07,326 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:07,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:07,326 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:07,326 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:07,326 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:07,326 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:07,326 INFO ]: Start difference. First operand 14 states and 178 transitions. Second operand 3 states. [2018-06-22 01:25:07,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:07,631 INFO ]: Finished difference Result 16 states and 204 transitions. [2018-06-22 01:25:07,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:07,632 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:25:07,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:07,632 INFO ]: With dead ends: 16 [2018-06-22 01:25:07,632 INFO ]: Without dead ends: 14 [2018-06-22 01:25:07,633 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-22 01:25:07,633 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:25:07,635 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:25:07,635 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:25:07,635 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2018-06-22 01:25:07,636 INFO ]: Start accepts. Automaton has 14 states and 161 transitions. Word has length 8 [2018-06-22 01:25:07,636 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:07,636 INFO ]: Abstraction has 14 states and 161 transitions. [2018-06-22 01:25:07,636 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:07,636 INFO ]: Start isEmpty. Operand 14 states and 161 transitions. [2018-06-22 01:25:07,636 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:07,636 INFO ]: Found error trace [2018-06-22 01:25:07,636 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:07,636 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:07,636 INFO ]: Analyzing trace with hash -1173685446, now seen corresponding path program 1 times [2018-06-22 01:25:07,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:07,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:07,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:07,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:07,705 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:07,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:07,705 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:07,705 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:07,705 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:07,705 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:07,706 INFO ]: Start difference. First operand 14 states and 161 transitions. Second operand 3 states. [2018-06-22 01:25:07,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:07,861 INFO ]: Finished difference Result 17 states and 230 transitions. [2018-06-22 01:25:07,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:07,861 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:25:07,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:07,862 INFO ]: With dead ends: 17 [2018-06-22 01:25:07,862 INFO ]: Without dead ends: 17 [2018-06-22 01:25:07,863 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-22 01:25:07,863 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:25:07,865 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-22 01:25:07,865 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:25:07,866 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2018-06-22 01:25:07,866 INFO ]: Start accepts. Automaton has 15 states and 184 transitions. Word has length 8 [2018-06-22 01:25:07,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:07,866 INFO ]: Abstraction has 15 states and 184 transitions. [2018-06-22 01:25:07,866 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:07,866 INFO ]: Start isEmpty. Operand 15 states and 184 transitions. [2018-06-22 01:25:07,867 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:25:07,867 INFO ]: Found error trace [2018-06-22 01:25:07,867 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:07,867 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:07,867 INFO ]: Analyzing trace with hash -1111809539, now seen corresponding path program 1 times [2018-06-22 01:25:07,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:07,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:07,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:07,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:07,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:07,944 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:07,944 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:07,944 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:07,944 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:07,945 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:07,945 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:07,945 INFO ]: Start difference. First operand 15 states and 184 transitions. Second operand 3 states. [2018-06-22 01:25:08,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:08,147 INFO ]: Finished difference Result 17 states and 202 transitions. [2018-06-22 01:25:08,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:08,147 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:25:08,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:08,148 INFO ]: With dead ends: 17 [2018-06-22 01:25:08,148 INFO ]: Without dead ends: 15 [2018-06-22 01:25:08,148 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-22 01:25:08,148 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:25:08,150 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:25:08,150 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:25:08,151 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2018-06-22 01:25:08,151 INFO ]: Start accepts. Automaton has 14 states and 133 transitions. Word has length 8 [2018-06-22 01:25:08,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:08,151 INFO ]: Abstraction has 14 states and 133 transitions. [2018-06-22 01:25:08,151 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:08,151 INFO ]: Start isEmpty. Operand 14 states and 133 transitions. [2018-06-22 01:25:08,151 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:08,151 INFO ]: Found error trace [2018-06-22 01:25:08,151 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:08,151 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:08,152 INFO ]: Analyzing trace with hash -899816354, now seen corresponding path program 2 times [2018-06-22 01:25:08,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:08,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:08,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:08,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:08,252 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:08,252 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:08,252 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:08,252 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:08,252 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:08,252 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:08,253 INFO ]: Start difference. First operand 14 states and 133 transitions. Second operand 3 states. [2018-06-22 01:25:08,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:08,317 INFO ]: Finished difference Result 21 states and 146 transitions. [2018-06-22 01:25:08,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:08,318 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:25:08,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:08,320 INFO ]: With dead ends: 21 [2018-06-22 01:25:08,320 INFO ]: Without dead ends: 17 [2018-06-22 01:25:08,320 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-22 01:25:08,320 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:25:08,322 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-22 01:25:08,322 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:25:08,323 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 106 transitions. [2018-06-22 01:25:08,323 INFO ]: Start accepts. Automaton has 15 states and 106 transitions. Word has length 9 [2018-06-22 01:25:08,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:08,323 INFO ]: Abstraction has 15 states and 106 transitions. [2018-06-22 01:25:08,323 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:08,323 INFO ]: Start isEmpty. Operand 15 states and 106 transitions. [2018-06-22 01:25:08,323 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:08,323 INFO ]: Found error trace [2018-06-22 01:25:08,323 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:08,324 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:08,324 INFO ]: Analyzing trace with hash -1787320035, now seen corresponding path program 1 times [2018-06-22 01:25:08,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:08,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:08,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,324 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:25:08,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:08,419 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:08,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:08,419 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:08,420 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:08,420 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:08,420 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:08,420 INFO ]: Start difference. First operand 15 states and 106 transitions. Second operand 3 states. [2018-06-22 01:25:08,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:08,484 INFO ]: Finished difference Result 21 states and 110 transitions. [2018-06-22 01:25:08,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:08,484 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:25:08,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:08,485 INFO ]: With dead ends: 21 [2018-06-22 01:25:08,485 INFO ]: Without dead ends: 18 [2018-06-22 01:25:08,485 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-22 01:25:08,485 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:25:08,487 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:25:08,487 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:25:08,487 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2018-06-22 01:25:08,487 INFO ]: Start accepts. Automaton has 15 states and 84 transitions. Word has length 9 [2018-06-22 01:25:08,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:08,487 INFO ]: Abstraction has 15 states and 84 transitions. [2018-06-22 01:25:08,487 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:08,488 INFO ]: Start isEmpty. Operand 15 states and 84 transitions. [2018-06-22 01:25:08,488 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:08,488 INFO ]: Found error trace [2018-06-22 01:25:08,488 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:08,488 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:08,488 INFO ]: Analyzing trace with hash -441749938, now seen corresponding path program 1 times [2018-06-22 01:25:08,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:08,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:08,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:08,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:08,564 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:08,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:08,564 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:08,565 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:08,565 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:08,565 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:08,565 INFO ]: Start difference. First operand 15 states and 84 transitions. Second operand 3 states. [2018-06-22 01:25:08,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:08,622 INFO ]: Finished difference Result 21 states and 105 transitions. [2018-06-22 01:25:08,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:08,623 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:25:08,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:08,623 INFO ]: With dead ends: 21 [2018-06-22 01:25:08,623 INFO ]: Without dead ends: 21 [2018-06-22 01:25:08,623 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-22 01:25:08,624 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:25:08,626 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-22 01:25:08,626 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:25:08,626 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 101 transitions. [2018-06-22 01:25:08,626 INFO ]: Start accepts. Automaton has 18 states and 101 transitions. Word has length 9 [2018-06-22 01:25:08,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:08,627 INFO ]: Abstraction has 18 states and 101 transitions. [2018-06-22 01:25:08,627 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:08,627 INFO ]: Start isEmpty. Operand 18 states and 101 transitions. [2018-06-22 01:25:08,627 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:08,627 INFO ]: Found error trace [2018-06-22 01:25:08,627 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:08,627 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:08,627 INFO ]: Analyzing trace with hash -488849509, now seen corresponding path program 1 times [2018-06-22 01:25:08,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:08,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:08,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:08,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:08,763 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:08,764 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:08,764 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:08,764 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:08,764 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:08,764 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:08,764 INFO ]: Start difference. First operand 18 states and 101 transitions. Second operand 3 states. [2018-06-22 01:25:08,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:08,970 INFO ]: Finished difference Result 16 states and 44 transitions. [2018-06-22 01:25:08,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:08,971 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:25:08,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:08,971 INFO ]: With dead ends: 16 [2018-06-22 01:25:08,971 INFO ]: Without dead ends: 11 [2018-06-22 01:25:08,971 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:08,972 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:25:08,972 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-22 01:25:08,973 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:25:08,973 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-22 01:25:08,973 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 9 [2018-06-22 01:25:08,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:08,973 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-22 01:25:08,973 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:08,973 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-22 01:25:08,973 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:25:08,973 INFO ]: Found error trace [2018-06-22 01:25:08,973 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:25:08,973 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:25:08,974 INFO ]: Analyzing trace with hash -1443770223, now seen corresponding path program 1 times [2018-06-22 01:25:08,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:25:08,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:25:08,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:25:08,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:25:08,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:25:09,029 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:09,030 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:25:09,030 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:25:09,030 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:25:09,030 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:25:09,030 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:25:09,030 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 3 states. [2018-06-22 01:25:09,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:25:09,037 INFO ]: Finished difference Result 5 states and 4 transitions. [2018-06-22 01:25:09,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:25:09,038 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:25:09,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:25:09,038 INFO ]: With dead ends: 5 [2018-06-22 01:25:09,038 INFO ]: Without dead ends: 0 [2018-06-22 01:25:09,038 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-22 01:25:09,038 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:25:09,038 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:25:09,038 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:25:09,038 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:25:09,038 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 01:25:09,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:25:09,038 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:25:09,038 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:25:09,038 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:25:09,038 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:25:09,043 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:25:09 BoogieIcfgContainer [2018-06-22 01:25:09,044 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:25:09,044 INFO ]: Toolchain (without parser) took 6121.61 ms. Allocated memory was 303.0 MB in the beginning and 356.0 MB in the end (delta: 53.0 MB). Free memory was 229.7 MB in the beginning and 196.9 MB in the end (delta: 32.8 MB). Peak memory consumption was 85.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:09,046 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:25:09,046 INFO ]: ChcToBoogie took 92.15 ms. Allocated memory is still 303.0 MB. Free memory was 229.7 MB in the beginning and 225.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:09,046 INFO ]: Boogie Preprocessor took 86.04 ms. Allocated memory is still 303.0 MB. Free memory was 225.7 MB in the beginning and 223.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:09,047 INFO ]: RCFGBuilder took 1041.58 ms. Allocated memory was 303.0 MB in the beginning and 324.0 MB in the end (delta: 21.0 MB). Free memory was 223.7 MB in the beginning and 280.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:09,048 INFO ]: TraceAbstraction took 4892.36 ms. Allocated memory was 324.0 MB in the beginning and 356.0 MB in the end (delta: 32.0 MB). Free memory was 280.7 MB in the beginning and 196.9 MB in the end (delta: 83.8 MB). Peak memory consumption was 115.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:09,051 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 92.15 ms. Allocated memory is still 303.0 MB. Free memory was 229.7 MB in the beginning and 225.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 86.04 ms. Allocated memory is still 303.0 MB. Free memory was 225.7 MB in the beginning and 223.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1041.58 ms. Allocated memory was 303.0 MB in the beginning and 324.0 MB in the end (delta: 21.0 MB). Free memory was 223.7 MB in the beginning and 280.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4892.36 ms. Allocated memory was 324.0 MB in the beginning and 356.0 MB in the end (delta: 32.0 MB). Free memory was 280.7 MB in the beginning and 196.9 MB in the end (delta: 83.8 MB). Peak memory consumption was 115.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 9 SDslu, 60 SDs, 0 SdLazy, 514 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231 SizeOfPredicates, 2 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 20/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-25-09-061.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-25-09-061.csv Received shutdown request...