java -Xss4m -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/HOLA/21.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:44:45,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:44:45,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:44:45,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:44:45,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:44:45,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:44:45,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:44:45,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:44:45,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:44:45,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:44:45,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:44:45,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:44:45,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:44:45,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:44:45,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:44:45,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:44:45,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:44:45,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:44:45,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:44:45,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:44:45,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:44:45,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:44:45,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:44:45,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:44:45,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:44:45,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:44:45,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:44:45,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:44:45,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:44:45,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:44:45,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:44:45,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:44:45,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:44:45,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:44:45,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:44:45,969 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:44:45,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:44:45,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:44:45,983 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:44:45,983 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:44:45,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:44:45,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:44:45,985 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:44:45,985 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:44:45,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:44:45,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:44:45,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:44:45,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:44:45,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:44:45,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:44:45,986 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:44:45,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:44:45,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:44:45,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:44:45,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:44:45,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:44:45,987 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:44:45,989 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:44:45,989 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:44:46,035 INFO ]: Repository-Root is: /tmp [2018-06-25 08:44:46,046 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:44:46,049 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:44:46,050 INFO ]: Initializing SmtParser... [2018-06-25 08:44:46,051 INFO ]: SmtParser initialized [2018-06-25 08:44:46,051 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-25 08:44:46,052 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:44:46,143 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 unknown [2018-06-25 08:44:46,829 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-25 08:44:46,834 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:44:46,848 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:44:46,849 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:44:46,849 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:44:46,849 INFO ]: ChcToBoogie initialized [2018-06-25 08:44:46,855 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,925 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46 Unit [2018-06-25 08:44:46,925 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:44:46,925 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:44:46,926 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:44:46,926 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:44:46,945 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,945 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,961 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,961 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,981 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,992 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:46,995 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... [2018-06-25 08:44:47,000 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:44:47,000 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:44:47,000 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:44:47,000 INFO ]: RCFGBuilder initialized [2018-06-25 08:44:47,001 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:44:47,014 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:44:47,014 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:44:47,014 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:44:47,014 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:44:47,014 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:44:47,014 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-25 08:44:48,090 INFO ]: Using library mode [2018-06-25 08:44:48,090 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:44:48 BoogieIcfgContainer [2018-06-25 08:44:48,090 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:44:48,091 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:44:48,091 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:44:48,096 INFO ]: TraceAbstraction initialized [2018-06-25 08:44:48,096 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:44:46" (1/3) ... [2018-06-25 08:44:48,097 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9265cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:44:48, skipping insertion in model container [2018-06-25 08:44:48,097 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:44:46" (2/3) ... [2018-06-25 08:44:48,097 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9265cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:44:48, skipping insertion in model container [2018-06-25 08:44:48,097 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:44:48" (3/3) ... [2018-06-25 08:44:48,099 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:44:48,108 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:44:48,117 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:44:48,166 INFO ]: Using default assertion order modulation [2018-06-25 08:44:48,167 INFO ]: Interprodecural is true [2018-06-25 08:44:48,167 INFO ]: Hoare is false [2018-06-25 08:44:48,167 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:44:48,167 INFO ]: Backedges is TWOTRACK [2018-06-25 08:44:48,167 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:44:48,167 INFO ]: Difference is false [2018-06-25 08:44:48,167 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:44:48,167 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:44:48,185 INFO ]: Start isEmpty. Operand 41 states. [2018-06-25 08:44:48,199 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:44:48,199 INFO ]: Found error trace [2018-06-25 08:44:48,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:44:48,200 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:44:48,207 INFO ]: Analyzing trace with hash 1496508572, now seen corresponding path program 1 times [2018-06-25 08:44:48,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:44:48,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:44:48,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:48,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:48,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:48,367 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:49,253 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:49,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:44:49,259 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:44:49,261 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:44:49,271 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:44:49,272 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:44:49,273 INFO ]: Start difference. First operand 41 states. Second operand 10 states. [2018-06-25 08:44:49,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:44:49,793 INFO ]: Finished difference Result 62 states and 70 transitions. [2018-06-25 08:44:49,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:44:49,795 INFO ]: Start accepts. Automaton has 10 states. Word has length 24 [2018-06-25 08:44:49,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:44:49,806 INFO ]: With dead ends: 62 [2018-06-25 08:44:49,806 INFO ]: Without dead ends: 56 [2018-06-25 08:44:49,809 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:44:49,826 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 08:44:49,846 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-06-25 08:44:49,847 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 08:44:49,850 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-25 08:44:49,851 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2018-06-25 08:44:49,851 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:44:49,851 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-25 08:44:49,851 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:44:49,851 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-25 08:44:49,852 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:44:49,852 INFO ]: Found error trace [2018-06-25 08:44:49,853 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:44:49,854 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:44:49,854 INFO ]: Analyzing trace with hash 803417578, now seen corresponding path program 1 times [2018-06-25 08:44:49,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:44:49,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:44:49,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:49,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:49,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:49,964 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:50,899 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:50,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:44:50,899 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) [2018-06-25 08:44:50,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:44:51,089 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:51,106 INFO ]: Computing forward predicates... [2018-06-25 08:44:52,952 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:52,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:44:52,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 47 [2018-06-25 08:44:52,975 INFO ]: Interpolant automaton has 47 states [2018-06-25 08:44:52,975 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-25 08:44:52,978 INFO ]: CoverageRelationStatistics Valid=110, Invalid=2052, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 08:44:52,978 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 47 states. [2018-06-25 08:44:56,218 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-06-25 08:44:57,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:44:57,100 INFO ]: Finished difference Result 216 states and 250 transitions. [2018-06-25 08:44:57,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-25 08:44:57,100 INFO ]: Start accepts. Automaton has 47 states. Word has length 34 [2018-06-25 08:44:57,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:44:57,106 INFO ]: With dead ends: 216 [2018-06-25 08:44:57,106 INFO ]: Without dead ends: 206 [2018-06-25 08:44:57,114 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2173, Invalid=9383, Unknown=0, NotChecked=0, Total=11556 [2018-06-25 08:44:57,114 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-25 08:44:57,127 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 51. [2018-06-25 08:44:57,127 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-25 08:44:57,129 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-06-25 08:44:57,129 INFO ]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 34 [2018-06-25 08:44:57,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:44:57,130 INFO ]: Abstraction has 51 states and 58 transitions. [2018-06-25 08:44:57,130 INFO ]: Interpolant automaton has 47 states. [2018-06-25 08:44:57,130 INFO ]: Start isEmpty. Operand 51 states and 58 transitions. [2018-06-25 08:44:57,131 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:44:57,131 INFO ]: Found error trace [2018-06-25 08:44:57,131 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:44:57,131 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:44:57,131 INFO ]: Analyzing trace with hash 2129911398, now seen corresponding path program 1 times [2018-06-25 08:44:57,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:44:57,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:44:57,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:57,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,170 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:57,321 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:57,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:44:57,321 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:44:57,321 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:44:57,321 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:44:57,321 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:44:57,321 INFO ]: Start difference. First operand 51 states and 58 transitions. Second operand 4 states. [2018-06-25 08:44:57,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:44:57,342 INFO ]: Finished difference Result 78 states and 88 transitions. [2018-06-25 08:44:57,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:44:57,348 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-25 08:44:57,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:44:57,349 INFO ]: With dead ends: 78 [2018-06-25 08:44:57,349 INFO ]: Without dead ends: 77 [2018-06-25 08:44:57,349 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:44:57,349 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-25 08:44:57,358 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 52. [2018-06-25 08:44:57,358 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 08:44:57,359 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-06-25 08:44:57,359 INFO ]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2018-06-25 08:44:57,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:44:57,359 INFO ]: Abstraction has 52 states and 58 transitions. [2018-06-25 08:44:57,359 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:44:57,359 INFO ]: Start isEmpty. Operand 52 states and 58 transitions. [2018-06-25 08:44:57,360 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:44:57,360 INFO ]: Found error trace [2018-06-25 08:44:57,360 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:44:57,360 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:44:57,360 INFO ]: Analyzing trace with hash -1687381904, now seen corresponding path program 1 times [2018-06-25 08:44:57,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:44:57,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:44:57,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:57,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,390 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:57,537 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:57,538 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:44:57,538 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:44:57,538 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:44:57,538 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:44:57,538 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:44:57,538 INFO ]: Start difference. First operand 52 states and 58 transitions. Second operand 4 states. [2018-06-25 08:44:57,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:44:57,558 INFO ]: Finished difference Result 76 states and 84 transitions. [2018-06-25 08:44:57,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:44:57,558 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-25 08:44:57,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:44:57,559 INFO ]: With dead ends: 76 [2018-06-25 08:44:57,559 INFO ]: Without dead ends: 75 [2018-06-25 08:44:57,559 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:44:57,559 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-25 08:44:57,563 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 52. [2018-06-25 08:44:57,563 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 08:44:57,563 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-06-25 08:44:57,564 INFO ]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2018-06-25 08:44:57,564 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:44:57,564 INFO ]: Abstraction has 52 states and 57 transitions. [2018-06-25 08:44:57,564 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:44:57,564 INFO ]: Start isEmpty. Operand 52 states and 57 transitions. [2018-06-25 08:44:57,565 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:44:57,565 INFO ]: Found error trace [2018-06-25 08:44:57,565 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:44:57,565 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:44:57,565 INFO ]: Analyzing trace with hash -360888084, now seen corresponding path program 1 times [2018-06-25 08:44:57,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:44:57,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:44:57,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:57,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:44:57,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:58,184 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:58,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:44:58,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:44:58,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:44:58,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:44:58,333 INFO ]: Computing forward predicates... [2018-06-25 08:44:59,136 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:44:59,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:44:59,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-06-25 08:44:59,166 INFO ]: Interpolant automaton has 50 states [2018-06-25 08:44:59,166 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 08:44:59,166 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2346, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 08:44:59,166 INFO ]: Start difference. First operand 52 states and 57 transitions. Second operand 50 states. [2018-06-25 08:45:01,458 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-25 08:45:02,014 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-06-25 08:45:02,490 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-25 08:45:02,746 WARN ]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-06-25 08:45:03,000 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-25 08:45:04,385 WARN ]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-25 08:45:04,942 WARN ]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-06-25 08:45:05,203 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-06-25 08:45:05,848 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-25 08:45:06,630 WARN ]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-06-25 08:45:07,054 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-06-25 08:45:07,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:07,654 INFO ]: Finished difference Result 306 states and 341 transitions. [2018-06-25 08:45:07,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-25 08:45:07,657 INFO ]: Start accepts. Automaton has 50 states. Word has length 34 [2018-06-25 08:45:07,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:07,658 INFO ]: With dead ends: 306 [2018-06-25 08:45:07,659 INFO ]: Without dead ends: 296 [2018-06-25 08:45:07,661 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2884 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2617, Invalid=11663, Unknown=0, NotChecked=0, Total=14280 [2018-06-25 08:45:07,661 INFO ]: Start minimizeSevpa. Operand 296 states. [2018-06-25 08:45:07,674 INFO ]: Finished minimizeSevpa. Reduced states from 296 to 57. [2018-06-25 08:45:07,674 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 08:45:07,675 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-06-25 08:45:07,675 INFO ]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 34 [2018-06-25 08:45:07,675 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:07,675 INFO ]: Abstraction has 57 states and 64 transitions. [2018-06-25 08:45:07,675 INFO ]: Interpolant automaton has 50 states. [2018-06-25 08:45:07,675 INFO ]: Start isEmpty. Operand 57 states and 64 transitions. [2018-06-25 08:45:07,676 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:45:07,676 INFO ]: Found error trace [2018-06-25 08:45:07,676 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:07,676 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:07,676 INFO ]: Analyzing trace with hash -755834708, now seen corresponding path program 1 times [2018-06-25 08:45:07,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:07,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:07,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:07,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:07,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:07,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:08,661 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:08,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:45:08,661 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:45:08,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:08,794 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:08,803 INFO ]: Computing forward predicates... [2018-06-25 08:45:09,540 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:09,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:45:09,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-06-25 08:45:09,561 INFO ]: Interpolant automaton has 50 states [2018-06-25 08:45:09,561 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 08:45:09,561 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2346, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 08:45:09,561 INFO ]: Start difference. First operand 57 states and 64 transitions. Second operand 50 states. [2018-06-25 08:45:11,787 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-25 08:45:12,393 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-06-25 08:45:12,808 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-25 08:45:13,151 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-25 08:45:13,877 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-25 08:45:14,429 WARN ]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-06-25 08:45:14,920 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-25 08:45:15,368 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-06-25 08:45:15,721 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-06-25 08:45:15,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:15,922 INFO ]: Finished difference Result 293 states and 327 transitions. [2018-06-25 08:45:15,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-25 08:45:15,922 INFO ]: Start accepts. Automaton has 50 states. Word has length 34 [2018-06-25 08:45:15,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:15,923 INFO ]: With dead ends: 293 [2018-06-25 08:45:15,923 INFO ]: Without dead ends: 283 [2018-06-25 08:45:15,926 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2617, Invalid=11663, Unknown=0, NotChecked=0, Total=14280 [2018-06-25 08:45:15,926 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-25 08:45:15,932 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 58. [2018-06-25 08:45:15,932 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 08:45:15,933 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-06-25 08:45:15,933 INFO ]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 34 [2018-06-25 08:45:15,933 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:15,933 INFO ]: Abstraction has 58 states and 65 transitions. [2018-06-25 08:45:15,933 INFO ]: Interpolant automaton has 50 states. [2018-06-25 08:45:15,933 INFO ]: Start isEmpty. Operand 58 states and 65 transitions. [2018-06-25 08:45:15,934 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:45:15,934 INFO ]: Found error trace [2018-06-25 08:45:15,934 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:15,934 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:15,934 INFO ]: Analyzing trace with hash 1994627372, now seen corresponding path program 1 times [2018-06-25 08:45:15,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:15,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:15,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:15,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:15,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:15,956 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:16,150 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:16,150 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:16,150 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:45:16,151 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:45:16,151 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:45:16,151 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:45:16,151 INFO ]: Start difference. First operand 58 states and 65 transitions. Second operand 4 states. [2018-06-25 08:45:16,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:16,181 INFO ]: Finished difference Result 88 states and 98 transitions. [2018-06-25 08:45:16,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:45:16,181 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-25 08:45:16,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:16,182 INFO ]: With dead ends: 88 [2018-06-25 08:45:16,182 INFO ]: Without dead ends: 84 [2018-06-25 08:45:16,182 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:45:16,183 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 08:45:16,187 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 57. [2018-06-25 08:45:16,187 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 08:45:16,188 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-25 08:45:16,188 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 34 [2018-06-25 08:45:16,188 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:16,188 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-25 08:45:16,188 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:45:16,188 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-25 08:45:16,189 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:16,189 INFO ]: Found error trace [2018-06-25 08:45:16,190 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:16,192 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:16,192 INFO ]: Analyzing trace with hash 1819257272, now seen corresponding path program 2 times [2018-06-25 08:45:16,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:16,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:16,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:16,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:16,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:16,231 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:17,068 INFO ]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:17,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:45:17,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:45:17,074 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:45:17,218 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:45:17,218 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:17,229 INFO ]: Computing forward predicates... [2018-06-25 08:45:19,045 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:19,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:45:19,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 67 [2018-06-25 08:45:19,066 INFO ]: Interpolant automaton has 67 states [2018-06-25 08:45:19,066 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-25 08:45:19,067 INFO ]: CoverageRelationStatistics Valid=178, Invalid=4244, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:45:19,067 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 67 states. [2018-06-25 08:45:21,234 WARN ]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-06-25 08:45:22,063 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-25 08:45:24,586 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-06-25 08:45:26,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:26,965 INFO ]: Finished difference Result 225 states and 245 transitions. [2018-06-25 08:45:26,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-06-25 08:45:26,965 INFO ]: Start accepts. Automaton has 67 states. Word has length 44 [2018-06-25 08:45:26,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:26,966 INFO ]: With dead ends: 225 [2018-06-25 08:45:26,966 INFO ]: Without dead ends: 205 [2018-06-25 08:45:26,971 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5660 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3450, Invalid=18900, Unknown=0, NotChecked=0, Total=22350 [2018-06-25 08:45:26,971 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-25 08:45:26,978 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 62. [2018-06-25 08:45:26,978 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-25 08:45:26,979 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-06-25 08:45:26,981 INFO ]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2018-06-25 08:45:26,981 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:26,981 INFO ]: Abstraction has 62 states and 68 transitions. [2018-06-25 08:45:26,981 INFO ]: Interpolant automaton has 67 states. [2018-06-25 08:45:26,981 INFO ]: Start isEmpty. Operand 62 states and 68 transitions. [2018-06-25 08:45:26,982 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:26,982 INFO ]: Found error trace [2018-06-25 08:45:26,982 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:26,983 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:26,983 INFO ]: Analyzing trace with hash 654951610, now seen corresponding path program 1 times [2018-06-25 08:45:26,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:26,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:26,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:45:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:27,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:27,202 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:27,202 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:27,202 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:45:27,203 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:45:27,203 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:45:27,203 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:45:27,203 INFO ]: Start difference. First operand 62 states and 68 transitions. Second operand 12 states. [2018-06-25 08:45:27,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:27,522 INFO ]: Finished difference Result 160 states and 172 transitions. [2018-06-25 08:45:27,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:45:27,522 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 08:45:27,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:27,523 INFO ]: With dead ends: 160 [2018-06-25 08:45:27,523 INFO ]: Without dead ends: 159 [2018-06-25 08:45:27,523 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:45:27,523 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-25 08:45:27,528 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 71. [2018-06-25 08:45:27,534 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 08:45:27,535 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2018-06-25 08:45:27,536 INFO ]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 44 [2018-06-25 08:45:27,536 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:27,536 INFO ]: Abstraction has 71 states and 79 transitions. [2018-06-25 08:45:27,536 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:45:27,536 INFO ]: Start isEmpty. Operand 71 states and 79 transitions. [2018-06-25 08:45:27,536 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:27,537 INFO ]: Found error trace [2018-06-25 08:45:27,537 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:27,537 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:27,537 INFO ]: Analyzing trace with hash 260004986, now seen corresponding path program 1 times [2018-06-25 08:45:27,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:27,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:27,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:27,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:27,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:27,555 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:27,757 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:27,757 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:27,757 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:45:27,757 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:45:27,757 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:45:27,757 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:45:27,757 INFO ]: Start difference. First operand 71 states and 79 transitions. Second operand 12 states. [2018-06-25 08:45:27,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:27,911 INFO ]: Finished difference Result 103 states and 110 transitions. [2018-06-25 08:45:27,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:45:27,912 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 08:45:27,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:27,912 INFO ]: With dead ends: 103 [2018-06-25 08:45:27,912 INFO ]: Without dead ends: 79 [2018-06-25 08:45:27,913 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:45:27,913 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 08:45:27,916 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-06-25 08:45:27,916 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 08:45:27,917 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-25 08:45:27,917 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 44 [2018-06-25 08:45:27,917 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:27,917 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-25 08:45:27,917 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:45:27,917 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-25 08:45:27,918 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:27,918 INFO ]: Found error trace [2018-06-25 08:45:27,918 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:27,918 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:27,918 INFO ]: Analyzing trace with hash 1999465018, now seen corresponding path program 2 times [2018-06-25 08:45:27,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:27,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:27,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:27,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:27,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:27,935 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:28,074 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:28,074 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:28,074 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:45:28,074 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:45:28,074 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:45:28,074 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:45:28,075 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 12 states. [2018-06-25 08:45:28,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:28,215 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-25 08:45:28,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:45:28,215 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 08:45:28,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:28,215 INFO ]: With dead ends: 52 [2018-06-25 08:45:28,215 INFO ]: Without dead ends: 47 [2018-06-25 08:45:28,216 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:45:28,216 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 08:45:28,217 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-25 08:45:28,217 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 08:45:28,218 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-06-25 08:45:28,218 INFO ]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-06-25 08:45:28,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:28,218 INFO ]: Abstraction has 47 states and 49 transitions. [2018-06-25 08:45:28,218 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:45:28,218 INFO ]: Start isEmpty. Operand 47 states and 49 transitions. [2018-06-25 08:45:28,219 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:28,219 INFO ]: Found error trace [2018-06-25 08:45:28,219 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:28,219 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:28,219 INFO ]: Analyzing trace with hash 835159356, now seen corresponding path program 2 times [2018-06-25 08:45:28,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:28,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:28,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:28,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:45:28,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:28,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:29,821 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:29,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:45:29,821 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:45:29,826 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:45:29,975 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:45:29,975 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:29,984 INFO ]: Computing forward predicates... [2018-06-25 08:45:31,708 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:31,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:45:31,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 67 [2018-06-25 08:45:31,730 INFO ]: Interpolant automaton has 67 states [2018-06-25 08:45:31,730 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-25 08:45:31,730 INFO ]: CoverageRelationStatistics Valid=169, Invalid=4253, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:45:31,730 INFO ]: Start difference. First operand 47 states and 49 transitions. Second operand 67 states. [2018-06-25 08:45:37,069 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-06-25 08:45:37,599 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-25 08:45:38,070 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-06-25 08:45:38,408 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-06-25 08:45:38,749 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-06-25 08:45:39,070 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-25 08:45:39,373 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-06-25 08:45:39,829 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-25 08:45:40,256 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-06-25 08:45:40,680 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-06-25 08:45:41,103 WARN ]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2018-06-25 08:45:41,526 WARN ]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-06-25 08:45:41,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:41,885 INFO ]: Finished difference Result 239 states and 253 transitions. [2018-06-25 08:45:41,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-06-25 08:45:41,885 INFO ]: Start accepts. Automaton has 67 states. Word has length 44 [2018-06-25 08:45:41,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:41,886 INFO ]: With dead ends: 239 [2018-06-25 08:45:41,886 INFO ]: Without dead ends: 219 [2018-06-25 08:45:41,887 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5486 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3565, Invalid=19997, Unknown=0, NotChecked=0, Total=23562 [2018-06-25 08:45:41,887 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-25 08:45:41,892 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 56. [2018-06-25 08:45:41,892 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-25 08:45:41,892 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-06-25 08:45:41,892 INFO ]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-06-25 08:45:41,892 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:41,892 INFO ]: Abstraction has 56 states and 59 transitions. [2018-06-25 08:45:41,892 INFO ]: Interpolant automaton has 67 states. [2018-06-25 08:45:41,892 INFO ]: Start isEmpty. Operand 56 states and 59 transitions. [2018-06-25 08:45:41,893 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:41,893 INFO ]: Found error trace [2018-06-25 08:45:41,893 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:41,893 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:41,893 INFO ]: Analyzing trace with hash 440212732, now seen corresponding path program 1 times [2018-06-25 08:45:41,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:41,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:41,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:41,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:45:41,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:41,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:42,010 INFO ]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:42,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:42,011 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:45:42,011 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:45:42,011 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:45:42,011 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:45:42,011 INFO ]: Start difference. First operand 56 states and 59 transitions. Second operand 12 states. [2018-06-25 08:45:42,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:42,172 INFO ]: Finished difference Result 110 states and 115 transitions. [2018-06-25 08:45:42,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:45:42,172 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 08:45:42,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:42,172 INFO ]: With dead ends: 110 [2018-06-25 08:45:42,172 INFO ]: Without dead ends: 90 [2018-06-25 08:45:42,172 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:45:42,172 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-25 08:45:42,174 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 55. [2018-06-25 08:45:42,174 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 08:45:42,175 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-06-25 08:45:42,175 INFO ]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 44 [2018-06-25 08:45:42,175 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:42,175 INFO ]: Abstraction has 55 states and 57 transitions. [2018-06-25 08:45:42,175 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:45:42,175 INFO ]: Start isEmpty. Operand 55 states and 57 transitions. [2018-06-25 08:45:42,176 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:42,176 INFO ]: Found error trace [2018-06-25 08:45:42,179 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:42,179 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:42,179 INFO ]: Analyzing trace with hash 1559391484, now seen corresponding path program 2 times [2018-06-25 08:45:42,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:42,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:42,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:42,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:45:42,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:42,195 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:42,530 INFO ]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:42,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:45:42,556 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:45:42,556 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:45:42,557 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:45:42,557 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:45:42,557 INFO ]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-06-25 08:45:42,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:45:42,697 INFO ]: Finished difference Result 49 states and 49 transitions. [2018-06-25 08:45:42,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:45:42,698 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 08:45:42,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:45:42,698 INFO ]: With dead ends: 49 [2018-06-25 08:45:42,698 INFO ]: Without dead ends: 48 [2018-06-25 08:45:42,698 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:45:42,698 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 08:45:42,699 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-06-25 08:45:42,699 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 08:45:42,700 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-25 08:45:42,700 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 44 [2018-06-25 08:45:42,700 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:45:42,700 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-25 08:45:42,700 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:45:42,700 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-25 08:45:42,701 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:45:42,701 INFO ]: Found error trace [2018-06-25 08:45:42,701 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:45:42,701 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:45:42,701 INFO ]: Analyzing trace with hash 1164444860, now seen corresponding path program 2 times [2018-06-25 08:45:42,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:45:42,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:45:42,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:42,702 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:45:42,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:45:42,717 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:43,798 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:43,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:45:43,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:45:43,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:45:43,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:45:43,954 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:45:43,962 INFO ]: Computing forward predicates... [2018-06-25 08:45:45,419 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:45:45,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:45:45,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 67 [2018-06-25 08:45:45,441 INFO ]: Interpolant automaton has 67 states [2018-06-25 08:45:45,441 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-25 08:45:45,441 INFO ]: CoverageRelationStatistics Valid=169, Invalid=4253, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:45:45,441 INFO ]: Start difference. First operand 45 states and 45 transitions. Second operand 67 states. Received shutdown request... [2018-06-25 08:45:49,328 WARN ]: Removed 2 from assertion stack [2018-06-25 08:45:49,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 08:45:49,328 WARN ]: Verification canceled [2018-06-25 08:45:49,333 WARN ]: Timeout [2018-06-25 08:45:49,333 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:45:49 BoogieIcfgContainer [2018-06-25 08:45:49,333 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:45:49,334 INFO ]: Toolchain (without parser) took 62499.70 ms. Allocated memory was 302.0 MB in the beginning and 841.5 MB in the end (delta: 539.5 MB). Free memory was 225.3 MB in the beginning and 472.6 MB in the end (delta: -247.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:45:49,334 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:45:49,335 INFO ]: ChcToBoogie took 76.46 ms. Allocated memory is still 302.0 MB. Free memory was 225.3 MB in the beginning and 222.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:45:49,335 INFO ]: Boogie Preprocessor took 74.25 ms. Allocated memory is still 302.0 MB. Free memory was 222.3 MB in the beginning and 220.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:45:49,335 INFO ]: RCFGBuilder took 1090.01 ms. Allocated memory was 302.0 MB in the beginning and 326.1 MB in the end (delta: 24.1 MB). Free memory was 220.3 MB in the beginning and 272.6 MB in the end (delta: -52.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:45:49,336 INFO ]: TraceAbstraction took 61241.69 ms. Allocated memory was 326.1 MB in the beginning and 841.5 MB in the end (delta: 515.4 MB). Free memory was 272.6 MB in the beginning and 472.6 MB in the end (delta: -200.0 MB). Peak memory consumption was 315.4 MB. Max. memory is 3.6 GB. [2018-06-25 08:45:49,338 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.46 ms. Allocated memory is still 302.0 MB. Free memory was 225.3 MB in the beginning and 222.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 74.25 ms. Allocated memory is still 302.0 MB. Free memory was 222.3 MB in the beginning and 220.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1090.01 ms. Allocated memory was 302.0 MB in the beginning and 326.1 MB in the end (delta: 24.1 MB). Free memory was 220.3 MB in the beginning and 272.6 MB in the end (delta: -52.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61241.69 ms. Allocated memory was 326.1 MB in the beginning and 841.5 MB in the end (delta: 515.4 MB). Free memory was 272.6 MB in the beginning and 472.6 MB in the end (delta: -200.0 MB). Peak memory consumption was 315.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (45states) and interpolant automaton (currently 44 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 139. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. TIMEOUT Result, 61.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 42.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 720 SDtfs, 8902 SDslu, 16274 SDs, 0 SdLazy, 8893 SolverSat, 1537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1005 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 880 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21683 ImplicationChecksByTransitivity, 49.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1163 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 793 ConstructedInterpolants, 57 QuantifiedInterpolants, 131037 SizeOfPredicates, 456 NumberOfNonLiveVariables, 7677 ConjunctsInSsa, 474 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 71/158 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-45-49-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-45-49-348.csv Completed graceful shutdown