java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__stpcpy_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:44:20,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:44:20,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:44:20,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:44:20,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:44:20,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:44:20,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:44:20,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:44:20,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:44:20,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:44:20,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:44:20,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:44:20,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:44:20,109 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:44:20,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:44:20,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:44:20,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:44:20,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:44:20,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:44:20,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:44:20,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:44:20,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:44:20,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:44:20,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:44:20,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:44:20,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:44:20,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:44:20,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:44:20,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:44:20,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:44:20,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:44:20,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:44:20,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:44:20,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:44:20,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:44:20,145 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:44:20,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:44:20,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:44:20,169 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:44:20,169 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:44:20,170 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:44:20,170 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:44:20,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:44:20,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:44:20,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:44:20,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:44:20,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:20,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:44:20,172 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:44:20,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:44:20,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:44:20,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:44:20,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:44:20,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:44:20,174 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:44:20,175 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:44:20,175 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:44:20,220 INFO ]: Repository-Root is: /tmp [2018-06-22 11:44:20,232 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:44:20,235 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:44:20,236 INFO ]: Initializing SmtParser... [2018-06-22 11:44:20,237 INFO ]: SmtParser initialized [2018-06-22 11:44:20,237 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__stpcpy_1.array.smt2 [2018-06-22 11:44:20,239 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:44:20,329 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__stpcpy_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1889887b [2018-06-22 11:44:20,537 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__stpcpy_1.array.smt2 [2018-06-22 11:44:20,541 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:44:20,554 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:44:20,555 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:44:20,555 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:44:20,555 INFO ]: ChcToBoogie initialized [2018-06-22 11:44:20,560 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,607 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20 Unit [2018-06-22 11:44:20,607 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:44:20,608 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:44:20,608 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:44:20,608 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:44:20,630 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,630 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,638 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,639 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,642 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,644 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,645 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... [2018-06-22 11:44:20,646 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:44:20,647 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:44:20,647 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:44:20,647 INFO ]: RCFGBuilder initialized [2018-06-22 11:44:20,649 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:44:20,662 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:44:20,662 INFO ]: Found specification of procedure False [2018-06-22 11:44:20,662 INFO ]: Found implementation of procedure False [2018-06-22 11:44:20,662 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:44:20,662 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:44:20,662 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:44:20,662 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:44:20,662 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:44:20,662 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:20,858 INFO ]: Using library mode [2018-06-22 11:44:20,859 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:20 BoogieIcfgContainer [2018-06-22 11:44:20,859 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:44:20,860 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:44:20,860 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:44:20,873 INFO ]: TraceAbstraction initialized [2018-06-22 11:44:20,873 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:20" (1/3) ... [2018-06-22 11:44:20,874 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110bc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:44:20, skipping insertion in model container [2018-06-22 11:44:20,874 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:20" (2/3) ... [2018-06-22 11:44:20,875 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110bc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:44:20, skipping insertion in model container [2018-06-22 11:44:20,875 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:20" (3/3) ... [2018-06-22 11:44:20,876 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:44:20,895 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:44:20,906 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:44:20,957 INFO ]: Using default assertion order modulation [2018-06-22 11:44:20,958 INFO ]: Interprodecural is true [2018-06-22 11:44:20,958 INFO ]: Hoare is false [2018-06-22 11:44:20,958 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:44:20,958 INFO ]: Backedges is TWOTRACK [2018-06-22 11:44:20,958 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:44:20,958 INFO ]: Difference is false [2018-06-22 11:44:20,958 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:44:20,958 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:44:20,971 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:44:20,984 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:20,984 INFO ]: Found error trace [2018-06-22 11:44:20,987 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:20,987 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:20,991 INFO ]: Analyzing trace with hash -1122768265, now seen corresponding path program 1 times [2018-06-22 11:44:20,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:20,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:21,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:21,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:21,199 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:21,201 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:21,202 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:21,203 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:21,217 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:21,217 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:21,220 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:44:21,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:21,383 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:44:21,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:21,385 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:21,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:21,394 INFO ]: With dead ends: 15 [2018-06-22 11:44:21,394 INFO ]: Without dead ends: 15 [2018-06-22 11:44:21,396 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:21,411 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:44:21,429 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:44:21,430 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:44:21,431 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:44:21,432 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:44:21,432 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:21,432 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:44:21,432 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:21,432 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:44:21,434 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:21,434 INFO ]: Found error trace [2018-06-22 11:44:21,434 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:21,434 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:21,434 INFO ]: Analyzing trace with hash -1863190075, now seen corresponding path program 1 times [2018-06-22 11:44:21,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:21,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:21,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:21,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:21,513 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:21,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:21,513 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:21,514 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:21,514 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:21,515 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:21,515 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 11:44:21,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:21,767 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-22 11:44:21,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:21,767 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:44:21,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:21,768 INFO ]: With dead ends: 17 [2018-06-22 11:44:21,768 INFO ]: Without dead ends: 17 [2018-06-22 11:44:21,769 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:21,769 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:44:21,776 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-22 11:44:21,776 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:44:21,777 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-22 11:44:21,777 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 13 [2018-06-22 11:44:21,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:21,777 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-22 11:44:21,777 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:21,777 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-22 11:44:21,780 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:21,780 INFO ]: Found error trace [2018-06-22 11:44:21,780 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:21,780 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:21,780 INFO ]: Analyzing trace with hash -2108440928, now seen corresponding path program 1 times [2018-06-22 11:44:21,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:21,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:21,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:21,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,054 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-06-22 11:44:22,339 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:22,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:22,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:22,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:22,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,393 INFO ]: Computing forward predicates... [2018-06-22 11:44:22,693 WARN ]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-22 11:44:23,029 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-06-22 11:44:23,029 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:23,036 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 11:44:23,036 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-06-22 11:44:23,100 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:23,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:23,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:44:23,133 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:23,133 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:23,133 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:23,133 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 8 states. [2018-06-22 11:44:23,549 WARN ]: Spent 357.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-06-22 11:44:24,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:24,374 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:44:24,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:24,375 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:44:24,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:24,376 INFO ]: With dead ends: 19 [2018-06-22 11:44:24,376 INFO ]: Without dead ends: 19 [2018-06-22 11:44:24,377 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:24,377 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:44:24,384 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:44:24,384 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:24,385 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 11:44:24,385 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 13 [2018-06-22 11:44:24,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:24,385 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 11:44:24,385 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:24,385 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 11:44:24,388 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:24,388 INFO ]: Found error trace [2018-06-22 11:44:24,388 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:24,388 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:24,388 INFO ]: Analyzing trace with hash 1548248505, now seen corresponding path program 1 times [2018-06-22 11:44:24,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:24,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:24,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:24,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:24,563 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:24,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:24,563 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:24,563 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:24,563 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:24,563 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:24,564 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2018-06-22 11:44:24,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:24,725 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-22 11:44:24,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:24,726 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:44:24,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:24,727 INFO ]: With dead ends: 19 [2018-06-22 11:44:24,727 INFO ]: Without dead ends: 19 [2018-06-22 11:44:24,727 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:24,727 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:44:24,731 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:44:24,731 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:24,732 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 11:44:24,732 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 13 [2018-06-22 11:44:24,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:24,732 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 11:44:24,732 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:24,732 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 11:44:24,733 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:24,733 INFO ]: Found error trace [2018-06-22 11:44:24,733 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:24,734 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:24,734 INFO ]: Analyzing trace with hash -759430098, now seen corresponding path program 1 times [2018-06-22 11:44:24,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:24,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:24,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:24,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:24,915 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:24,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:24,915 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-22 11:44:24,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:24,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:24,954 INFO ]: Computing forward predicates... [2018-06-22 11:44:25,022 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-06-22 11:44:25,023 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:25,029 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:25,029 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-06-22 11:44:25,081 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:25,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:25,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:44:25,112 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:44:25,113 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:44:25,113 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:25,113 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 9 states. [2018-06-22 11:44:25,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:25,281 INFO ]: Finished difference Result 21 states and 33 transitions. [2018-06-22 11:44:25,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:25,284 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:44:25,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:25,285 INFO ]: With dead ends: 21 [2018-06-22 11:44:25,285 INFO ]: Without dead ends: 21 [2018-06-22 11:44:25,285 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:25,285 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:44:25,289 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 11:44:25,289 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:25,290 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-22 11:44:25,290 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 17 [2018-06-22 11:44:25,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:25,290 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-22 11:44:25,290 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:44:25,290 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-22 11:44:25,291 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:25,291 INFO ]: Found error trace [2018-06-22 11:44:25,291 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:25,291 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:25,291 INFO ]: Analyzing trace with hash 478196361, now seen corresponding path program 2 times [2018-06-22 11:44:25,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:25,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:25,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:25,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:25,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:25,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:25,587 INFO ]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:25,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:25,587 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-22 11:44:25,601 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:25,645 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:25,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:25,648 INFO ]: Computing forward predicates... [2018-06-22 11:44:25,801 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-06-22 11:44:25,802 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:25,809 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:25,809 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-06-22 11:44:25,847 INFO ]: detected not equals via solver [2018-06-22 11:44:25,849 INFO ]: detected not equals via solver [2018-06-22 11:44:25,867 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-06-22 11:44:25,869 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:44:25,890 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:44:25,891 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:44 [2018-06-22 11:44:25,922 INFO ]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:25,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:25,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:44:25,942 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:25,942 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:25,942 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:25,942 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 11 states. [2018-06-22 11:44:26,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:26,146 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-22 11:44:26,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:26,146 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:44:26,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:26,147 INFO ]: With dead ends: 21 [2018-06-22 11:44:26,147 INFO ]: Without dead ends: 21 [2018-06-22 11:44:26,148 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:26,148 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:44:26,153 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:44:26,153 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:26,154 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-22 11:44:26,154 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 17 [2018-06-22 11:44:26,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:26,154 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-22 11:44:26,154 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:26,154 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-22 11:44:26,155 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:26,155 INFO ]: Found error trace [2018-06-22 11:44:26,155 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:26,155 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:26,155 INFO ]: Analyzing trace with hash 704705570, now seen corresponding path program 1 times [2018-06-22 11:44:26,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:26,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:26,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,156 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:26,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,240 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:26,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:26,241 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-22 11:44:26,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:26,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,279 INFO ]: Computing forward predicates... [2018-06-22 11:44:26,356 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-06-22 11:44:26,357 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:26,361 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:26,361 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-06-22 11:44:26,393 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:26,412 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:26,413 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-06-22 11:44:26,413 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:26,413 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:26,413 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:26,413 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 11 states. [2018-06-22 11:44:26,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:26,676 INFO ]: Finished difference Result 23 states and 36 transitions. [2018-06-22 11:44:26,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:26,677 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:44:26,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:26,678 INFO ]: With dead ends: 23 [2018-06-22 11:44:26,678 INFO ]: Without dead ends: 23 [2018-06-22 11:44:26,678 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:26,678 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:44:26,683 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:44:26,683 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:26,684 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-22 11:44:26,684 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 17 [2018-06-22 11:44:26,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:26,684 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-22 11:44:26,684 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:26,684 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-22 11:44:26,685 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:26,685 INFO ]: Found error trace [2018-06-22 11:44:26,685 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:26,685 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:26,685 INFO ]: Analyzing trace with hash 962163275, now seen corresponding path program 2 times [2018-06-22 11:44:26,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:26,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:26,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:26,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,910 INFO ]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:26,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:26,910 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-22 11:44:26,918 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:26,934 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:26,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,936 INFO ]: Computing forward predicates... [2018-06-22 11:44:27,024 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-06-22 11:44:27,025 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:27,030 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:27,030 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-06-22 11:44:27,064 INFO ]: detected not equals via solver [2018-06-22 11:44:27,065 INFO ]: detected not equals via solver [2018-06-22 11:44:27,080 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-06-22 11:44:27,081 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:44:27,113 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:44:27,113 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:46 [2018-06-22 11:44:27,125 INFO ]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:44:27,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:27,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:44:27,147 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:27,147 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:27,147 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:27,147 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 11 states. [2018-06-22 11:44:27,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:27,324 INFO ]: Finished difference Result 23 states and 35 transitions. [2018-06-22 11:44:27,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:27,325 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:44:27,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:27,325 INFO ]: With dead ends: 23 [2018-06-22 11:44:27,325 INFO ]: Without dead ends: 23 [2018-06-22 11:44:27,326 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:27,326 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:44:27,330 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:44:27,330 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:27,331 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-22 11:44:27,331 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 21 [2018-06-22 11:44:27,331 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:27,331 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-22 11:44:27,331 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:27,331 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-22 11:44:27,332 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:27,332 INFO ]: Found error trace [2018-06-22 11:44:27,332 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:27,332 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:27,332 INFO ]: Analyzing trace with hash -1190658473, now seen corresponding path program 2 times [2018-06-22 11:44:27,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:27,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:27,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:27,333 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:27,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:27,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:27,672 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:27,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:27,672 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-22 11:44:27,677 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:27,699 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:27,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:27,701 INFO ]: Computing forward predicates... [2018-06-22 11:44:27,899 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-06-22 11:44:27,900 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:27,909 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:27,909 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-06-22 11:44:27,952 INFO ]: detected not equals via solver [2018-06-22 11:44:27,953 INFO ]: detected not equals via solver [2018-06-22 11:44:27,965 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-06-22 11:44:27,966 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:44:28,007 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:44:28,008 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:46 [2018-06-22 11:44:28,062 INFO ]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:44:28,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:28,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-06-22 11:44:28,082 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:44:28,082 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:44:28,082 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:44:28,083 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 14 states. [2018-06-22 11:44:28,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:28,355 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-22 11:44:28,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:28,356 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:44:28,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:28,356 INFO ]: With dead ends: 13 [2018-06-22 11:44:28,356 INFO ]: Without dead ends: 0 [2018-06-22 11:44:28,356 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:44:28,356 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:44:28,356 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:44:28,356 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:44:28,356 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:44:28,356 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:44:28,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:28,356 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:44:28,356 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:44:28,356 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:44:28,356 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:44:28,360 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:44:28 BoogieIcfgContainer [2018-06-22 11:44:28,360 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:44:28,361 INFO ]: Toolchain (without parser) took 7819.48 ms. Allocated memory was 302.0 MB in the beginning and 375.9 MB in the end (delta: 73.9 MB). Free memory was 258.4 MB in the beginning and 209.8 MB in the end (delta: 48.6 MB). Peak memory consumption was 122.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:28,362 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:44:28,362 INFO ]: ChcToBoogie took 52.72 ms. Allocated memory is still 302.0 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:28,363 INFO ]: Boogie Preprocessor took 38.47 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:28,363 INFO ]: RCFGBuilder took 211.71 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:28,364 INFO ]: TraceAbstraction took 7500.71 ms. Allocated memory was 302.0 MB in the beginning and 375.9 MB in the end (delta: 73.9 MB). Free memory was 246.4 MB in the beginning and 209.8 MB in the end (delta: 36.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:28,367 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.72 ms. Allocated memory is still 302.0 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.47 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 211.71 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7500.71 ms. Allocated memory was 302.0 MB in the beginning and 375.9 MB in the end (delta: 73.9 MB). Free memory was 246.4 MB in the beginning and 209.8 MB in the end (delta: 36.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 15 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 31 SDslu, 356 SDs, 0 SdLazy, 573 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 86 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 232 ConstructedInterpolants, 2 QuantifiedInterpolants, 31916 SizeOfPredicates, 85 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 90/144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__stpcpy_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-44-28-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__stpcpy_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-44-28-377.csv Received shutdown request...