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/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:20:32,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:20:32,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:20:32,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:20:32,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:20:32,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:20:32,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:20:32,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:20:32,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:20:32,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:20:32,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:20:32,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:20:32,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:20:32,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:20:32,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:20:32,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:20:32,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:20:32,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:20:32,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:20:32,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:20:32,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:20:32,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:20:32,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:20:32,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:20:32,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:20:32,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:20:32,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:20:32,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:20:32,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:20:32,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:20:32,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:20:32,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:20:32,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:20:32,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:20:32,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:20:32,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:20:32,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:20:32,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:20:32,377 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:20:32,377 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:20:32,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:20:32,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:20:32,379 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:20:32,379 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:20:32,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:20:32,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:20:32,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:20:32,380 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:20:32,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:20:32,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:20:32,380 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:20:32,381 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:20:32,383 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:20:32,383 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:20:32,428 INFO ]: Repository-Root is: /tmp [2018-06-25 09:20:32,443 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:20:32,449 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:20:32,450 INFO ]: Initializing SmtParser... [2018-06-25 09:20:32,451 INFO ]: SmtParser initialized [2018-06-25 09:20:32,451 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-25 09:20:32,453 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 09:20:32,546 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 unknown [2018-06-25 09:20:32,779 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-25 09:20:32,784 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:20:32,794 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:20:32,795 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:20:32,795 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:20:32,795 INFO ]: ChcToBoogie initialized [2018-06-25 09:20:32,799 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,858 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32 Unit [2018-06-25 09:20:32,858 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:20:32,859 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:20:32,859 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:20:32,859 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:20:32,879 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,879 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,885 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,885 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,894 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,897 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,898 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (1/1) ... [2018-06-25 09:20:32,903 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:20:32,904 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:20:32,904 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:20:32,904 INFO ]: RCFGBuilder initialized [2018-06-25 09:20:32,908 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (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 09:20:32,918 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:20:32,918 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:20:32,918 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:20:32,918 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:20:32,918 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:20:32,918 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 09:20:33,300 INFO ]: Using library mode [2018-06-25 09:20:33,301 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:20:33 BoogieIcfgContainer [2018-06-25 09:20:33,301 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:20:33,302 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:20:33,302 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:20:33,305 INFO ]: TraceAbstraction initialized [2018-06-25 09:20:33,305 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:20:32" (1/3) ... [2018-06-25 09:20:33,306 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f6be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:20:33, skipping insertion in model container [2018-06-25 09:20:33,307 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:20:32" (2/3) ... [2018-06-25 09:20:33,307 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f6be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:20:33, skipping insertion in model container [2018-06-25 09:20:33,307 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:20:33" (3/3) ... [2018-06-25 09:20:33,309 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:20:33,318 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:20:33,326 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:20:33,364 INFO ]: Using default assertion order modulation [2018-06-25 09:20:33,364 INFO ]: Interprodecural is true [2018-06-25 09:20:33,364 INFO ]: Hoare is false [2018-06-25 09:20:33,364 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:20:33,364 INFO ]: Backedges is TWOTRACK [2018-06-25 09:20:33,364 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:20:33,364 INFO ]: Difference is false [2018-06-25 09:20:33,364 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:20:33,365 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:20:33,378 INFO ]: Start isEmpty. Operand 23 states. [2018-06-25 09:20:33,389 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:20:33,389 INFO ]: Found error trace [2018-06-25 09:20:33,390 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:33,390 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:33,393 INFO ]: Analyzing trace with hash -1897800257, now seen corresponding path program 1 times [2018-06-25 09:20:33,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:33,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:33,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:33,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:33,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:33,460 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:33,547 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:20:33,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:33,549 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:20:33,550 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:20:33,561 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:20:33,561 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:20:33,565 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-25 09:20:33,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:33,925 INFO ]: Finished difference Result 39 states and 57 transitions. [2018-06-25 09:20:33,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:20:33,927 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:20:33,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:33,935 INFO ]: With dead ends: 39 [2018-06-25 09:20:33,935 INFO ]: Without dead ends: 39 [2018-06-25 09:20:33,937 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:33,950 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:20:33,969 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:20:33,971 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:20:33,973 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2018-06-25 09:20:33,974 INFO ]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 9 [2018-06-25 09:20:33,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:33,974 INFO ]: Abstraction has 39 states and 57 transitions. [2018-06-25 09:20:33,975 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:20:33,975 INFO ]: Start isEmpty. Operand 39 states and 57 transitions. [2018-06-25 09:20:33,976 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:20:33,976 INFO ]: Found error trace [2018-06-25 09:20:33,976 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:33,976 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:33,976 INFO ]: Analyzing trace with hash 1748653349, now seen corresponding path program 1 times [2018-06-25 09:20:33,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:33,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:33,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:33,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:33,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:33,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:34,088 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:20:34,088 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:34,089 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:20:34,090 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:20:34,090 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:20:34,090 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:20:34,090 INFO ]: Start difference. First operand 39 states and 57 transitions. Second operand 4 states. [2018-06-25 09:20:34,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:34,236 INFO ]: Finished difference Result 57 states and 84 transitions. [2018-06-25 09:20:34,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:20:34,237 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:20:34,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:34,238 INFO ]: With dead ends: 57 [2018-06-25 09:20:34,238 INFO ]: Without dead ends: 57 [2018-06-25 09:20:34,239 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:34,239 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:20:34,248 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-25 09:20:34,248 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 09:20:34,251 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2018-06-25 09:20:34,251 INFO ]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 11 [2018-06-25 09:20:34,251 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:34,251 INFO ]: Abstraction has 57 states and 84 transitions. [2018-06-25 09:20:34,251 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:20:34,251 INFO ]: Start isEmpty. Operand 57 states and 84 transitions. [2018-06-25 09:20:34,256 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:20:34,256 INFO ]: Found error trace [2018-06-25 09:20:34,256 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:34,257 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:34,257 INFO ]: Analyzing trace with hash 1573310567, now seen corresponding path program 1 times [2018-06-25 09:20:34,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:34,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:34,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:34,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:34,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:34,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:34,647 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 09:20:34,674 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:20:34,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:34,674 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:20:34,674 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:20:34,674 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:20:34,674 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:34,674 INFO ]: Start difference. First operand 57 states and 84 transitions. Second operand 5 states. [2018-06-25 09:20:34,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:34,967 INFO ]: Finished difference Result 132 states and 252 transitions. [2018-06-25 09:20:34,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:20:34,969 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:20:34,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:34,978 INFO ]: With dead ends: 132 [2018-06-25 09:20:34,978 INFO ]: Without dead ends: 132 [2018-06-25 09:20:34,978 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:20:34,978 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-25 09:20:35,011 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 63. [2018-06-25 09:20:35,012 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:20:35,013 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2018-06-25 09:20:35,013 INFO ]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 11 [2018-06-25 09:20:35,013 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:35,013 INFO ]: Abstraction has 63 states and 93 transitions. [2018-06-25 09:20:35,013 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:20:35,013 INFO ]: Start isEmpty. Operand 63 states and 93 transitions. [2018-06-25 09:20:35,016 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:20:35,016 INFO ]: Found error trace [2018-06-25 09:20:35,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:35,017 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:35,017 INFO ]: Analyzing trace with hash 1573340358, now seen corresponding path program 1 times [2018-06-25 09:20:35,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:35,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:35,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:35,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:35,080 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:20:35,080 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:35,080 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:20:35,081 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:20:35,081 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:20:35,081 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:35,081 INFO ]: Start difference. First operand 63 states and 93 transitions. Second operand 5 states. [2018-06-25 09:20:35,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:35,368 INFO ]: Finished difference Result 116 states and 191 transitions. [2018-06-25 09:20:35,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:20:35,370 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:20:35,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:35,372 INFO ]: With dead ends: 116 [2018-06-25 09:20:35,372 INFO ]: Without dead ends: 113 [2018-06-25 09:20:35,372 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:20:35,372 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-25 09:20:35,389 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 60. [2018-06-25 09:20:35,389 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 09:20:35,393 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-06-25 09:20:35,393 INFO ]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 11 [2018-06-25 09:20:35,393 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:35,393 INFO ]: Abstraction has 60 states and 87 transitions. [2018-06-25 09:20:35,394 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:20:35,394 INFO ]: Start isEmpty. Operand 60 states and 87 transitions. [2018-06-25 09:20:35,395 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:20:35,395 INFO ]: Found error trace [2018-06-25 09:20:35,395 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:35,395 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:35,395 INFO ]: Analyzing trace with hash -28485805, now seen corresponding path program 1 times [2018-06-25 09:20:35,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:35,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:35,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:35,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:35,456 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:20:35,456 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:35,456 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:20:35,456 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:20:35,456 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:20:35,456 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:20:35,456 INFO ]: Start difference. First operand 60 states and 87 transitions. Second operand 4 states. [2018-06-25 09:20:35,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:35,551 INFO ]: Finished difference Result 102 states and 160 transitions. [2018-06-25 09:20:35,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:20:35,551 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-25 09:20:35,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:35,553 INFO ]: With dead ends: 102 [2018-06-25 09:20:35,553 INFO ]: Without dead ends: 99 [2018-06-25 09:20:35,553 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:35,553 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-25 09:20:35,560 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-06-25 09:20:35,560 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:20:35,562 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-06-25 09:20:35,562 INFO ]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-06-25 09:20:35,562 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:35,562 INFO ]: Abstraction has 63 states and 90 transitions. [2018-06-25 09:20:35,562 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:20:35,562 INFO ]: Start isEmpty. Operand 63 states and 90 transitions. [2018-06-25 09:20:35,570 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:20:35,570 INFO ]: Found error trace [2018-06-25 09:20:35,570 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:35,570 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:35,570 INFO ]: Analyzing trace with hash 66760537, now seen corresponding path program 1 times [2018-06-25 09:20:35,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:35,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:35,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:35,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:35,616 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:35,801 INFO ]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:20:35,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:35,801 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-25 09:20:35,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:35,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:35,876 INFO ]: Computing forward predicates... [2018-06-25 09:20:36,349 INFO ]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:20:36,371 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:20:36,371 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-06-25 09:20:36,371 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:20:36,371 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:20:36,371 INFO ]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:20:36,371 INFO ]: Start difference. First operand 63 states and 90 transitions. Second operand 24 states. [2018-06-25 09:20:37,955 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-06-25 09:20:38,353 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-06-25 09:20:44,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:44,276 INFO ]: Finished difference Result 543 states and 1785 transitions. [2018-06-25 09:20:44,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-06-25 09:20:44,281 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-25 09:20:44,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:44,305 INFO ]: With dead ends: 543 [2018-06-25 09:20:44,305 INFO ]: Without dead ends: 460 [2018-06-25 09:20:44,310 INFO ]: 0 DeclaredPredicates, 153 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2080, Invalid=11030, Unknown=0, NotChecked=0, Total=13110 [2018-06-25 09:20:44,310 INFO ]: Start minimizeSevpa. Operand 460 states. [2018-06-25 09:20:44,482 INFO ]: Finished minimizeSevpa. Reduced states from 460 to 99. [2018-06-25 09:20:44,482 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-25 09:20:44,484 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2018-06-25 09:20:44,484 INFO ]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 26 [2018-06-25 09:20:44,484 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:44,484 INFO ]: Abstraction has 99 states and 145 transitions. [2018-06-25 09:20:44,484 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:20:44,484 INFO ]: Start isEmpty. Operand 99 states and 145 transitions. [2018-06-25 09:20:44,486 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:20:44,486 INFO ]: Found error trace [2018-06-25 09:20:44,487 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:44,487 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:44,487 INFO ]: Analyzing trace with hash 66790328, now seen corresponding path program 1 times [2018-06-25 09:20:44,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:44,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:44,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:44,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:44,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:44,509 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:44,630 INFO ]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:20:44,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:44,630 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 09:20:44,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:44,678 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:44,682 INFO ]: Computing forward predicates... [2018-06-25 09:20:44,688 INFO ]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:20:44,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:20:44,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:20:44,707 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:20:44,707 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:20:44,707 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:20:44,707 INFO ]: Start difference. First operand 99 states and 145 transitions. Second operand 10 states. [2018-06-25 09:20:45,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:45,040 INFO ]: Finished difference Result 217 states and 394 transitions. [2018-06-25 09:20:45,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:20:45,040 INFO ]: Start accepts. Automaton has 10 states. Word has length 26 [2018-06-25 09:20:45,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:45,044 INFO ]: With dead ends: 217 [2018-06-25 09:20:45,044 INFO ]: Without dead ends: 214 [2018-06-25 09:20:45,044 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:20:45,044 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-25 09:20:45,056 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 93. [2018-06-25 09:20:45,056 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-25 09:20:45,057 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2018-06-25 09:20:45,057 INFO ]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 26 [2018-06-25 09:20:45,058 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:45,058 INFO ]: Abstraction has 93 states and 136 transitions. [2018-06-25 09:20:45,058 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:20:45,058 INFO ]: Start isEmpty. Operand 93 states and 136 transitions. [2018-06-25 09:20:45,059 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:20:45,059 INFO ]: Found error trace [2018-06-25 09:20:45,059 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:45,059 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:45,060 INFO ]: Analyzing trace with hash -1622183205, now seen corresponding path program 1 times [2018-06-25 09:20:45,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:45,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:45,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:45,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:45,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:45,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:45,369 INFO ]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:20:45,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:45,369 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 09:20:45,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:45,424 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:45,427 INFO ]: Computing forward predicates... [2018-06-25 09:20:45,585 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:20:45,604 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:20:45,604 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2018-06-25 09:20:45,604 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:20:45,604 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:20:45,604 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:20:45,604 INFO ]: Start difference. First operand 93 states and 136 transitions. Second operand 17 states. [2018-06-25 09:20:46,358 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-25 09:20:49,429 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:20:49,795 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-25 09:20:50,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:50,521 INFO ]: Finished difference Result 509 states and 1784 transitions. [2018-06-25 09:20:50,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-06-25 09:20:50,526 INFO ]: Start accepts. Automaton has 17 states. Word has length 26 [2018-06-25 09:20:50,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:50,541 INFO ]: With dead ends: 509 [2018-06-25 09:20:50,541 INFO ]: Without dead ends: 509 [2018-06-25 09:20:50,545 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1482, Invalid=11628, Unknown=0, NotChecked=0, Total=13110 [2018-06-25 09:20:50,545 INFO ]: Start minimizeSevpa. Operand 509 states. [2018-06-25 09:20:50,648 INFO ]: Finished minimizeSevpa. Reduced states from 509 to 99. [2018-06-25 09:20:50,648 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-25 09:20:50,649 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2018-06-25 09:20:50,649 INFO ]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 26 [2018-06-25 09:20:50,649 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:50,649 INFO ]: Abstraction has 99 states and 145 transitions. [2018-06-25 09:20:50,649 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:20:50,649 INFO ]: Start isEmpty. Operand 99 states and 145 transitions. [2018-06-25 09:20:50,651 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:20:50,651 INFO ]: Found error trace [2018-06-25 09:20:50,651 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:50,651 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:50,651 INFO ]: Analyzing trace with hash -1495126807, now seen corresponding path program 1 times [2018-06-25 09:20:50,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:50,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:50,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:50,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:50,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:50,668 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:50,800 INFO ]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:20:50,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:50,800 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:20:50,800 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:20:50,800 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:20:50,800 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:20:50,800 INFO ]: Start difference. First operand 99 states and 145 transitions. Second operand 4 states. [2018-06-25 09:20:50,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:50,855 INFO ]: Finished difference Result 258 states and 456 transitions. [2018-06-25 09:20:50,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:20:50,856 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-25 09:20:50,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:50,860 INFO ]: With dead ends: 258 [2018-06-25 09:20:50,860 INFO ]: Without dead ends: 258 [2018-06-25 09:20:50,860 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:20:50,861 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-25 09:20:50,872 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 120. [2018-06-25 09:20:50,872 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-25 09:20:50,874 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2018-06-25 09:20:50,874 INFO ]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 28 [2018-06-25 09:20:50,874 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:50,874 INFO ]: Abstraction has 120 states and 178 transitions. [2018-06-25 09:20:50,874 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:20:50,874 INFO ]: Start isEmpty. Operand 120 states and 178 transitions. [2018-06-25 09:20:50,877 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:20:50,877 INFO ]: Found error trace [2018-06-25 09:20:50,877 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:50,877 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:50,877 INFO ]: Analyzing trace with hash -677478357, now seen corresponding path program 1 times [2018-06-25 09:20:50,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:50,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:50,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:50,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:50,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:50,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:51,247 INFO ]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:20:51,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:51,247 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:20:51,247 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:20:51,248 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:20:51,248 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:51,248 INFO ]: Start difference. First operand 120 states and 178 transitions. Second operand 5 states. [2018-06-25 09:20:51,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:51,407 INFO ]: Finished difference Result 238 states and 416 transitions. [2018-06-25 09:20:51,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:20:51,407 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-25 09:20:51,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:51,409 INFO ]: With dead ends: 238 [2018-06-25 09:20:51,409 INFO ]: Without dead ends: 198 [2018-06-25 09:20:51,410 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:20:51,410 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-25 09:20:51,419 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 120. [2018-06-25 09:20:51,419 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-25 09:20:51,420 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2018-06-25 09:20:51,420 INFO ]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 28 [2018-06-25 09:20:51,420 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:51,420 INFO ]: Abstraction has 120 states and 178 transitions. [2018-06-25 09:20:51,420 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:20:51,420 INFO ]: Start isEmpty. Operand 120 states and 178 transitions. [2018-06-25 09:20:51,424 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:20:51,424 INFO ]: Found error trace [2018-06-25 09:20:51,425 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:51,425 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:51,425 INFO ]: Analyzing trace with hash 479310105, now seen corresponding path program 1 times [2018-06-25 09:20:51,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:51,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:51,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:51,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:51,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:51,465 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:51,654 INFO ]: Checked inductivity of 26 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:20:51,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:51,654 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 09:20:51,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:51,716 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:51,721 INFO ]: Computing forward predicates... [2018-06-25 09:20:51,889 INFO ]: Checked inductivity of 26 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:20:51,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:20:51,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-25 09:20:51,912 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:20:51,912 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:20:51,912 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:20:51,912 INFO ]: Start difference. First operand 120 states and 178 transitions. Second operand 15 states. [2018-06-25 09:20:53,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:53,412 INFO ]: Finished difference Result 445 states and 1101 transitions. [2018-06-25 09:20:53,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:20:53,413 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-25 09:20:53,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:53,425 INFO ]: With dead ends: 445 [2018-06-25 09:20:53,425 INFO ]: Without dead ends: 445 [2018-06-25 09:20:53,426 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:20:53,426 INFO ]: Start minimizeSevpa. Operand 445 states. [2018-06-25 09:20:53,479 INFO ]: Finished minimizeSevpa. Reduced states from 445 to 171. [2018-06-25 09:20:53,479 INFO ]: Start removeUnreachable. Operand 171 states. [2018-06-25 09:20:53,482 INFO ]: Finished removeUnreachable. Reduced from 171 states to 171 states and 281 transitions. [2018-06-25 09:20:53,482 INFO ]: Start accepts. Automaton has 171 states and 281 transitions. Word has length 37 [2018-06-25 09:20:53,482 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:53,482 INFO ]: Abstraction has 171 states and 281 transitions. [2018-06-25 09:20:53,482 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:20:53,482 INFO ]: Start isEmpty. Operand 171 states and 281 transitions. [2018-06-25 09:20:53,486 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:20:53,486 INFO ]: Found error trace [2018-06-25 09:20:53,486 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:53,486 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:53,487 INFO ]: Analyzing trace with hash 1832619802, now seen corresponding path program 1 times [2018-06-25 09:20:53,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:53,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:53,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:53,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:53,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:53,495 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:53,628 INFO ]: Checked inductivity of 26 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:20:53,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:53,628 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 09:20:53,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:53,666 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:53,669 INFO ]: Computing forward predicates... [2018-06-25 09:20:53,719 INFO ]: Checked inductivity of 26 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:20:53,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:20:53,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-25 09:20:53,739 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:20:53,739 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:20:53,739 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:20:53,739 INFO ]: Start difference. First operand 171 states and 281 transitions. Second operand 13 states. [2018-06-25 09:20:54,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:54,608 INFO ]: Finished difference Result 458 states and 1214 transitions. [2018-06-25 09:20:54,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:20:54,608 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-25 09:20:54,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:54,617 INFO ]: With dead ends: 458 [2018-06-25 09:20:54,617 INFO ]: Without dead ends: 458 [2018-06-25 09:20:54,618 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:20:54,618 INFO ]: Start minimizeSevpa. Operand 458 states. [2018-06-25 09:20:54,666 INFO ]: Finished minimizeSevpa. Reduced states from 458 to 193. [2018-06-25 09:20:54,666 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-25 09:20:54,669 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 343 transitions. [2018-06-25 09:20:54,669 INFO ]: Start accepts. Automaton has 193 states and 343 transitions. Word has length 37 [2018-06-25 09:20:54,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:54,669 INFO ]: Abstraction has 193 states and 343 transitions. [2018-06-25 09:20:54,669 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:20:54,669 INFO ]: Start isEmpty. Operand 193 states and 343 transitions. [2018-06-25 09:20:54,675 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:20:54,675 INFO ]: Found error trace [2018-06-25 09:20:54,675 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:54,675 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:54,675 INFO ]: Analyzing trace with hash -854982029, now seen corresponding path program 1 times [2018-06-25 09:20:54,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:54,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:54,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:54,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:54,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:54,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:54,748 INFO ]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:20:54,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:20:54,748 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:20:54,748 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:20:54,748 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:20:54,748 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:20:54,748 INFO ]: Start difference. First operand 193 states and 343 transitions. Second operand 4 states. [2018-06-25 09:20:54,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:20:54,772 INFO ]: Finished difference Result 220 states and 386 transitions. [2018-06-25 09:20:54,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:20:54,773 INFO ]: Start accepts. Automaton has 4 states. Word has length 39 [2018-06-25 09:20:54,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:20:54,775 INFO ]: With dead ends: 220 [2018-06-25 09:20:54,775 INFO ]: Without dead ends: 193 [2018-06-25 09:20:54,775 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:20:54,775 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-25 09:20:54,785 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-06-25 09:20:54,785 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-25 09:20:54,788 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 341 transitions. [2018-06-25 09:20:54,788 INFO ]: Start accepts. Automaton has 193 states and 341 transitions. Word has length 39 [2018-06-25 09:20:54,788 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:20:54,788 INFO ]: Abstraction has 193 states and 341 transitions. [2018-06-25 09:20:54,788 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:20:54,788 INFO ]: Start isEmpty. Operand 193 states and 341 transitions. [2018-06-25 09:20:54,793 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:20:54,793 INFO ]: Found error trace [2018-06-25 09:20:54,793 INFO ]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:20:54,793 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:20:54,793 INFO ]: Analyzing trace with hash -302174831, now seen corresponding path program 1 times [2018-06-25 09:20:54,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:20:54,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:20:54,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:54,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:54,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:20:54,813 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:55,035 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:20:55,202 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-25 09:20:55,397 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 09:20:55,948 INFO ]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:20:55,948 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:20:55,948 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 09:20:55,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:20:55,989 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:20:55,994 INFO ]: Computing forward predicates... [2018-06-25 09:20:56,646 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-25 09:20:57,624 INFO ]: Checked inductivity of 50 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:20:57,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:20:57,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2018-06-25 09:20:57,643 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:20:57,643 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:20:57,644 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:20:57,644 INFO ]: Start difference. First operand 193 states and 341 transitions. Second operand 40 states. [2018-06-25 09:21:00,634 WARN ]: Spent 482.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-25 09:21:00,854 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-06-25 09:21:01,330 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-06-25 09:21:01,532 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-06-25 09:21:02,402 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-06-25 09:21:02,604 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-06-25 09:21:02,761 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-06-25 09:21:03,054 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-06-25 09:21:03,572 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-06-25 09:21:04,195 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-06-25 09:21:04,469 WARN ]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2018-06-25 09:21:05,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:05,766 INFO ]: Finished difference Result 745 states and 2992 transitions. [2018-06-25 09:21:05,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-25 09:21:05,767 INFO ]: Start accepts. Automaton has 40 states. Word has length 46 [2018-06-25 09:21:05,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:05,783 INFO ]: With dead ends: 745 [2018-06-25 09:21:05,783 INFO ]: Without dead ends: 745 [2018-06-25 09:21:05,785 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=747, Invalid=6563, Unknown=0, NotChecked=0, Total=7310 [2018-06-25 09:21:05,786 INFO ]: Start minimizeSevpa. Operand 745 states. [2018-06-25 09:21:05,924 INFO ]: Finished minimizeSevpa. Reduced states from 745 to 250. [2018-06-25 09:21:05,924 INFO ]: Start removeUnreachable. Operand 250 states. [2018-06-25 09:21:05,927 INFO ]: Finished removeUnreachable. Reduced from 250 states to 250 states and 466 transitions. [2018-06-25 09:21:05,927 INFO ]: Start accepts. Automaton has 250 states and 466 transitions. Word has length 46 [2018-06-25 09:21:05,927 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:05,927 INFO ]: Abstraction has 250 states and 466 transitions. [2018-06-25 09:21:05,927 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:21:05,927 INFO ]: Start isEmpty. Operand 250 states and 466 transitions. [2018-06-25 09:21:05,936 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:21:05,937 INFO ]: Found error trace [2018-06-25 09:21:05,937 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:05,937 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:05,938 INFO ]: Analyzing trace with hash -498688336, now seen corresponding path program 1 times [2018-06-25 09:21:05,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:05,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:05,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:05,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:05,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:05,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:06,299 INFO ]: Checked inductivity of 50 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:21:06,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:06,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:06,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:06,343 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:06,348 INFO ]: Computing forward predicates... [2018-06-25 09:21:06,605 INFO ]: Checked inductivity of 50 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:21:06,625 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:06,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-25 09:21:06,625 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:21:06,625 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:21:06,625 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:21:06,625 INFO ]: Start difference. First operand 250 states and 466 transitions. Second operand 12 states. [2018-06-25 09:21:07,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:07,216 INFO ]: Finished difference Result 420 states and 973 transitions. [2018-06-25 09:21:07,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:21:07,216 INFO ]: Start accepts. Automaton has 12 states. Word has length 46 [2018-06-25 09:21:07,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:07,220 INFO ]: With dead ends: 420 [2018-06-25 09:21:07,220 INFO ]: Without dead ends: 420 [2018-06-25 09:21:07,221 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1243, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:21:07,221 INFO ]: Start minimizeSevpa. Operand 420 states. [2018-06-25 09:21:07,242 INFO ]: Finished minimizeSevpa. Reduced states from 420 to 259. [2018-06-25 09:21:07,242 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-25 09:21:07,245 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 475 transitions. [2018-06-25 09:21:07,246 INFO ]: Start accepts. Automaton has 259 states and 475 transitions. Word has length 46 [2018-06-25 09:21:07,246 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:07,246 INFO ]: Abstraction has 259 states and 475 transitions. [2018-06-25 09:21:07,246 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:21:07,246 INFO ]: Start isEmpty. Operand 259 states and 475 transitions. [2018-06-25 09:21:07,257 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:21:07,257 INFO ]: Found error trace [2018-06-25 09:21:07,257 INFO ]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:07,257 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:07,257 INFO ]: Analyzing trace with hash -710969265, now seen corresponding path program 2 times [2018-06-25 09:21:07,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:07,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:07,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:07,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:07,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:07,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:07,462 INFO ]: Checked inductivity of 50 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:21:07,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:07,462 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:07,468 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:21:07,505 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:21:07,505 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:07,509 INFO ]: Computing forward predicates... [2018-06-25 09:21:07,612 INFO ]: Checked inductivity of 50 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:21:07,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:07,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-25 09:21:07,632 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:21:07,632 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:21:07,632 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:21:07,632 INFO ]: Start difference. First operand 259 states and 475 transitions. Second operand 18 states. [2018-06-25 09:21:10,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:10,962 INFO ]: Finished difference Result 961 states and 3824 transitions. [2018-06-25 09:21:10,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-06-25 09:21:10,962 INFO ]: Start accepts. Automaton has 18 states. Word has length 46 [2018-06-25 09:21:10,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:10,995 INFO ]: With dead ends: 961 [2018-06-25 09:21:10,995 INFO ]: Without dead ends: 958 [2018-06-25 09:21:10,998 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3346 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1454, Invalid=8646, Unknown=0, NotChecked=0, Total=10100 [2018-06-25 09:21:10,998 INFO ]: Start minimizeSevpa. Operand 958 states. [2018-06-25 09:21:11,123 INFO ]: Finished minimizeSevpa. Reduced states from 958 to 315. [2018-06-25 09:21:11,123 INFO ]: Start removeUnreachable. Operand 315 states. [2018-06-25 09:21:11,126 INFO ]: Finished removeUnreachable. Reduced from 315 states to 315 states and 623 transitions. [2018-06-25 09:21:11,126 INFO ]: Start accepts. Automaton has 315 states and 623 transitions. Word has length 46 [2018-06-25 09:21:11,126 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:11,126 INFO ]: Abstraction has 315 states and 623 transitions. [2018-06-25 09:21:11,126 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:21:11,126 INFO ]: Start isEmpty. Operand 315 states and 623 transitions. [2018-06-25 09:21:11,137 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:21:11,137 INFO ]: Found error trace [2018-06-25 09:21:11,137 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:11,137 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:11,137 INFO ]: Analyzing trace with hash -271155024, now seen corresponding path program 3 times [2018-06-25 09:21:11,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:11,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:11,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:11,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:21:11,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:11,155 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:11,403 INFO ]: Checked inductivity of 50 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:21:11,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:11,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:11,415 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:21:11,456 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:21:11,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:11,461 INFO ]: Computing forward predicates... [2018-06-25 09:21:11,865 INFO ]: Checked inductivity of 50 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:21:11,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:11,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 34 [2018-06-25 09:21:11,888 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:21:11,888 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:21:11,888 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1047, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:21:11,889 INFO ]: Start difference. First operand 315 states and 623 transitions. Second operand 34 states. [2018-06-25 09:21:18,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:18,528 INFO ]: Finished difference Result 994 states and 3401 transitions. [2018-06-25 09:21:18,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-25 09:21:18,528 INFO ]: Start accepts. Automaton has 34 states. Word has length 46 [2018-06-25 09:21:18,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:18,546 INFO ]: With dead ends: 994 [2018-06-25 09:21:18,546 INFO ]: Without dead ends: 994 [2018-06-25 09:21:18,548 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1189, Invalid=8317, Unknown=0, NotChecked=0, Total=9506 [2018-06-25 09:21:18,548 INFO ]: Start minimizeSevpa. Operand 994 states. [2018-06-25 09:21:18,629 INFO ]: Finished minimizeSevpa. Reduced states from 994 to 333. [2018-06-25 09:21:18,629 INFO ]: Start removeUnreachable. Operand 333 states. [2018-06-25 09:21:18,632 INFO ]: Finished removeUnreachable. Reduced from 333 states to 333 states and 639 transitions. [2018-06-25 09:21:18,632 INFO ]: Start accepts. Automaton has 333 states and 639 transitions. Word has length 46 [2018-06-25 09:21:18,632 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:18,632 INFO ]: Abstraction has 333 states and 639 transitions. [2018-06-25 09:21:18,632 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:21:18,632 INFO ]: Start isEmpty. Operand 333 states and 639 transitions. [2018-06-25 09:21:18,642 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-25 09:21:18,642 INFO ]: Found error trace [2018-06-25 09:21:18,642 INFO ]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:18,642 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:18,642 INFO ]: Analyzing trace with hash 338552203, now seen corresponding path program 1 times [2018-06-25 09:21:18,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:18,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:18,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:18,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:21:18,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:18,657 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:18,845 INFO ]: Checked inductivity of 64 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-25 09:21:18,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:18,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:18,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:18,896 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:18,899 INFO ]: Computing forward predicates... [2018-06-25 09:21:18,943 INFO ]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:21:18,961 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:21:18,961 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-06-25 09:21:18,962 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:21:18,962 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:21:18,962 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:21:18,962 INFO ]: Start difference. First operand 333 states and 639 transitions. Second operand 18 states. [2018-06-25 09:21:20,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:20,517 INFO ]: Finished difference Result 1037 states and 2218 transitions. [2018-06-25 09:21:20,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-25 09:21:20,518 INFO ]: Start accepts. Automaton has 18 states. Word has length 52 [2018-06-25 09:21:20,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:20,521 INFO ]: With dead ends: 1037 [2018-06-25 09:21:20,521 INFO ]: Without dead ends: 350 [2018-06-25 09:21:20,522 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=968, Invalid=3862, Unknown=0, NotChecked=0, Total=4830 [2018-06-25 09:21:20,522 INFO ]: Start minimizeSevpa. Operand 350 states. [2018-06-25 09:21:20,540 INFO ]: Finished minimizeSevpa. Reduced states from 350 to 237. [2018-06-25 09:21:20,540 INFO ]: Start removeUnreachable. Operand 237 states. [2018-06-25 09:21:20,542 INFO ]: Finished removeUnreachable. Reduced from 237 states to 237 states and 385 transitions. [2018-06-25 09:21:20,542 INFO ]: Start accepts. Automaton has 237 states and 385 transitions. Word has length 52 [2018-06-25 09:21:20,542 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:20,542 INFO ]: Abstraction has 237 states and 385 transitions. [2018-06-25 09:21:20,542 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:21:20,542 INFO ]: Start isEmpty. Operand 237 states and 385 transitions. [2018-06-25 09:21:20,546 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-25 09:21:20,546 INFO ]: Found error trace [2018-06-25 09:21:20,546 INFO ]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:20,546 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:20,546 INFO ]: Analyzing trace with hash -1022720337, now seen corresponding path program 2 times [2018-06-25 09:21:20,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:20,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:20,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:20,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:20,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:20,562 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:20,953 INFO ]: Checked inductivity of 64 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:21:20,954 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:20,954 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:20,960 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:21:21,004 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:21:21,004 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:21,008 INFO ]: Computing forward predicates... [2018-06-25 09:21:21,153 INFO ]: Checked inductivity of 64 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-25 09:21:21,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:21,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-06-25 09:21:21,173 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:21:21,173 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:21:21,173 INFO ]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:21:21,173 INFO ]: Start difference. First operand 237 states and 385 transitions. Second operand 21 states. [2018-06-25 09:21:23,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:23,696 INFO ]: Finished difference Result 575 states and 1143 transitions. [2018-06-25 09:21:23,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-25 09:21:23,697 INFO ]: Start accepts. Automaton has 21 states. Word has length 52 [2018-06-25 09:21:23,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:23,702 INFO ]: With dead ends: 575 [2018-06-25 09:21:23,702 INFO ]: Without dead ends: 524 [2018-06-25 09:21:23,703 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=761, Invalid=4351, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:21:23,703 INFO ]: Start minimizeSevpa. Operand 524 states. [2018-06-25 09:21:23,722 INFO ]: Finished minimizeSevpa. Reduced states from 524 to 306. [2018-06-25 09:21:23,722 INFO ]: Start removeUnreachable. Operand 306 states. [2018-06-25 09:21:23,724 INFO ]: Finished removeUnreachable. Reduced from 306 states to 306 states and 542 transitions. [2018-06-25 09:21:23,724 INFO ]: Start accepts. Automaton has 306 states and 542 transitions. Word has length 52 [2018-06-25 09:21:23,725 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:23,725 INFO ]: Abstraction has 306 states and 542 transitions. [2018-06-25 09:21:23,725 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:21:23,725 INFO ]: Start isEmpty. Operand 306 states and 542 transitions. [2018-06-25 09:21:23,730 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-25 09:21:23,730 INFO ]: Found error trace [2018-06-25 09:21:23,730 INFO ]: trace histogram [6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:23,730 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:23,730 INFO ]: Analyzing trace with hash 432649751, now seen corresponding path program 1 times [2018-06-25 09:21:23,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:23,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:23,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:23,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:21:23,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:23,749 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:24,006 INFO ]: Checked inductivity of 99 backedges. 37 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:21:24,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:24,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:24,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:24,066 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:24,071 INFO ]: Computing forward predicates... [2018-06-25 09:21:24,561 INFO ]: Checked inductivity of 99 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-25 09:21:24,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:24,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-06-25 09:21:24,581 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:21:24,581 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:21:24,581 INFO ]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:21:24,581 INFO ]: Start difference. First operand 306 states and 542 transitions. Second operand 30 states. Received shutdown request... [2018-06-25 09:21:33,519 WARN ]: Removed 2 from assertion stack [2018-06-25 09:21:33,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-06-25 09:21:33,519 WARN ]: Verification canceled [2018-06-25 09:21:33,522 WARN ]: Timeout [2018-06-25 09:21:33,523 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:21:33 BoogieIcfgContainer [2018-06-25 09:21:33,523 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:21:33,523 INFO ]: Toolchain (without parser) took 60739.23 ms. Allocated memory was 308.8 MB in the beginning and 730.9 MB in the end (delta: 422.1 MB). Free memory was 263.2 MB in the beginning and 340.2 MB in the end (delta: -77.0 MB). Peak memory consumption was 345.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:33,524 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:21:33,524 INFO ]: ChcToBoogie took 63.63 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:33,524 INFO ]: Boogie Preprocessor took 44.10 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 259.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:33,525 INFO ]: RCFGBuilder took 397.58 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 245.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:33,525 INFO ]: TraceAbstraction took 60220.41 ms. Allocated memory was 308.8 MB in the beginning and 730.9 MB in the end (delta: 422.1 MB). Free memory was 244.1 MB in the beginning and 340.2 MB in the end (delta: -96.1 MB). Peak memory consumption was 325.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:33,528 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 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.63 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.10 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 259.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 397.58 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 245.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60220.41 ms. Allocated memory was 308.8 MB in the beginning and 730.9 MB in the end (delta: 422.1 MB). Free memory was 244.1 MB in the beginning and 340.2 MB in the end (delta: -96.1 MB). Peak memory consumption was 325.9 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 (306states) and interpolant automaton (currently 209 states, 30 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 32. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. TIMEOUT Result, 60.1s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 48.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2464 SDtfs, 5751 SDslu, 22752 SDs, 0 SdLazy, 26587 SolverSat, 6312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1688 GetRequests, 637 SyntacticMatches, 24 SemanticMatches, 1026 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40498 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=17, 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.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 4096 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1124 ConstructedInterpolants, 8 QuantifiedInterpolants, 167795 SizeOfPredicates, 251 NumberOfNonLiveVariables, 4330 ConjunctsInSsa, 501 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 792/1065 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/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-21-33-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-21-33-630.csv Completed graceful shutdown