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/heap__cocome2.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:42:21,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:42:21,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:42:21,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:42:21,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:42:21,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:42:21,090 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:42:21,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:42:21,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:42:21,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:42:21,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:42:21,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:42:21,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:42:21,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:42:21,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:42:21,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:42:21,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:42:21,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:42:21,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:42:21,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:42:21,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:42:21,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:42:21,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:42:21,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:42:21,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:42:21,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:42:21,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:42:21,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:42:21,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:42:21,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:42:21,135 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:42:21,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:42:21,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:42:21,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:42:21,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:42:21,143 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:42:21,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:42:21,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:42:21,163 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:42:21,163 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:42:21,165 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:42:21,165 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:42:21,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:42:21,166 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:42:21,166 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:42:21,166 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:42:21,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:42:21,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:42:21,167 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:42:21,167 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:42:21,167 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:42:21,167 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:42:21,167 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:42:21,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:42:21,168 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:42:21,170 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:42:21,170 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:42:21,217 INFO ]: Repository-Root is: /tmp [2018-06-22 11:42:21,233 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:42:21,239 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:42:21,240 INFO ]: Initializing SmtParser... [2018-06-22 11:42:21,241 INFO ]: SmtParser initialized [2018-06-22 11:42:21,241 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/heap__cocome2.array.smt2 [2018-06-22 11:42:21,242 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:42:21,337 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__cocome2.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1c9b1b5b [2018-06-22 11:42:21,875 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__cocome2.array.smt2 [2018-06-22 11:42:21,880 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:42:21,887 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:42:21,887 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:42:21,887 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:42:21,887 INFO ]: ChcToBoogie initialized [2018-06-22 11:42:21,891 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:21,948 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21 Unit [2018-06-22 11:42:21,981 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:42:21,982 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:42:21,982 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:42:21,982 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:42:22,007 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,007 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,018 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,018 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,026 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,030 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,032 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (1/1) ... [2018-06-22 11:42:22,035 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:42:22,035 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:42:22,035 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:42:22,035 INFO ]: RCFGBuilder initialized [2018-06-22 11:42:22,036 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (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:42:22,050 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:42:22,050 INFO ]: Found specification of procedure False [2018-06-22 11:42:22,050 INFO ]: Found implementation of procedure False [2018-06-22 11:42:22,050 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:42:22,050 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:42:22,050 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:42:22,050 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:42:22,050 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:42:22,050 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:42:22,852 INFO ]: Using library mode [2018-06-22 11:42:22,907 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:22 BoogieIcfgContainer [2018-06-22 11:42:22,907 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:42:22,908 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:42:22,908 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:42:22,912 INFO ]: TraceAbstraction initialized [2018-06-22 11:42:22,912 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:21" (1/3) ... [2018-06-22 11:42:22,913 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7d7622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:42:22, skipping insertion in model container [2018-06-22 11:42:22,913 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:21" (2/3) ... [2018-06-22 11:42:22,913 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7d7622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:42:22, skipping insertion in model container [2018-06-22 11:42:22,913 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:22" (3/3) ... [2018-06-22 11:42:22,915 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:42:22,926 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:42:22,933 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:42:22,975 INFO ]: Using default assertion order modulation [2018-06-22 11:42:22,975 INFO ]: Interprodecural is true [2018-06-22 11:42:22,975 INFO ]: Hoare is false [2018-06-22 11:42:22,975 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:42:22,975 INFO ]: Backedges is TWOTRACK [2018-06-22 11:42:22,975 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:42:22,975 INFO ]: Difference is false [2018-06-22 11:42:22,975 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:42:22,975 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:42:22,991 INFO ]: Start isEmpty. Operand 36 states. [2018-06-22 11:42:23,026 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:23,026 INFO ]: Found error trace [2018-06-22 11:42:23,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:23,027 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:23,032 INFO ]: Analyzing trace with hash 1864926362, now seen corresponding path program 1 times [2018-06-22 11:42:23,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:23,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:23,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:23,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:23,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:23,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:23,399 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:42:23,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:23,402 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:23,404 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:23,419 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:23,419 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:23,422 INFO ]: Start difference. First operand 36 states. Second operand 4 states. [2018-06-22 11:42:23,912 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:23,912 INFO ]: Finished difference Result 27 states and 70 transitions. [2018-06-22 11:42:23,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:23,913 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:23,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:23,926 INFO ]: With dead ends: 27 [2018-06-22 11:42:23,926 INFO ]: Without dead ends: 27 [2018-06-22 11:42:23,928 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:42:23,941 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:42:23,970 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:42:23,971 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:42:23,973 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-06-22 11:42:23,974 INFO ]: Start accepts. Automaton has 27 states and 70 transitions. Word has length 9 [2018-06-22 11:42:23,975 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:23,975 INFO ]: Abstraction has 27 states and 70 transitions. [2018-06-22 11:42:23,975 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:23,975 INFO ]: Start isEmpty. Operand 27 states and 70 transitions. [2018-06-22 11:42:23,980 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:23,980 INFO ]: Found error trace [2018-06-22 11:42:23,980 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:23,980 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:23,981 INFO ]: Analyzing trace with hash 930096728, now seen corresponding path program 1 times [2018-06-22 11:42:23,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:23,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:23,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:23,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:23,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:24,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:24,105 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:42:24,123 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:24,123 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:24,125 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:24,125 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:24,125 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:24,126 INFO ]: Start difference. First operand 27 states and 70 transitions. Second operand 4 states. [2018-06-22 11:42:25,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:25,100 INFO ]: Finished difference Result 42 states and 154 transitions. [2018-06-22 11:42:25,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:25,101 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:25,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:25,106 INFO ]: With dead ends: 42 [2018-06-22 11:42:25,106 INFO ]: Without dead ends: 42 [2018-06-22 11:42:25,107 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-22 11:42:25,107 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:42:25,135 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:42:25,135 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:42:25,137 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-06-22 11:42:25,137 INFO ]: Start accepts. Automaton has 40 states and 132 transitions. Word has length 13 [2018-06-22 11:42:25,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:25,137 INFO ]: Abstraction has 40 states and 132 transitions. [2018-06-22 11:42:25,137 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:25,137 INFO ]: Start isEmpty. Operand 40 states and 132 transitions. [2018-06-22 11:42:25,141 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:25,141 INFO ]: Found error trace [2018-06-22 11:42:25,141 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:25,141 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:25,141 INFO ]: Analyzing trace with hash 1495999768, now seen corresponding path program 1 times [2018-06-22 11:42:25,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:25,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:25,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:25,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:25,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:25,159 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:25,226 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:42:25,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:25,226 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:25,227 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:25,227 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:25,227 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:25,227 INFO ]: Start difference. First operand 40 states and 132 transitions. Second operand 4 states. [2018-06-22 11:42:25,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:25,663 INFO ]: Finished difference Result 44 states and 154 transitions. [2018-06-22 11:42:25,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:25,664 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:25,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:25,666 INFO ]: With dead ends: 44 [2018-06-22 11:42:25,667 INFO ]: Without dead ends: 44 [2018-06-22 11:42:25,667 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-22 11:42:25,667 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:42:25,696 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 11:42:25,697 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:42:25,698 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-06-22 11:42:25,698 INFO ]: Start accepts. Automaton has 40 states and 128 transitions. Word has length 13 [2018-06-22 11:42:25,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:25,698 INFO ]: Abstraction has 40 states and 128 transitions. [2018-06-22 11:42:25,699 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:25,699 INFO ]: Start isEmpty. Operand 40 states and 128 transitions. [2018-06-22 11:42:25,701 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:25,701 INFO ]: Found error trace [2018-06-22 11:42:25,701 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:25,701 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:25,701 INFO ]: Analyzing trace with hash 1250748915, now seen corresponding path program 1 times [2018-06-22 11:42:25,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:25,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:25,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:25,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:25,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:25,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:25,744 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:42:25,786 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:25,786 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:25,786 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:25,786 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:25,786 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:25,787 INFO ]: Start difference. First operand 40 states and 128 transitions. Second operand 4 states. [2018-06-22 11:42:26,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:26,167 INFO ]: Finished difference Result 63 states and 245 transitions. [2018-06-22 11:42:26,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:26,168 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:26,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:26,171 INFO ]: With dead ends: 63 [2018-06-22 11:42:26,171 INFO ]: Without dead ends: 63 [2018-06-22 11:42:26,172 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-22 11:42:26,172 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:42:26,190 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:42:26,190 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:42:26,192 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 193 transitions. [2018-06-22 11:42:26,192 INFO ]: Start accepts. Automaton has 57 states and 193 transitions. Word has length 13 [2018-06-22 11:42:26,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:26,193 INFO ]: Abstraction has 57 states and 193 transitions. [2018-06-22 11:42:26,193 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:26,193 INFO ]: Start isEmpty. Operand 57 states and 193 transitions. [2018-06-22 11:42:26,196 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:26,196 INFO ]: Found error trace [2018-06-22 11:42:26,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:26,196 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:26,197 INFO ]: Analyzing trace with hash 1911100140, now seen corresponding path program 1 times [2018-06-22 11:42:26,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:26,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:26,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:26,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:26,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:26,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:26,238 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:42:26,238 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:26,238 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:26,238 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:26,239 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:26,239 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:26,239 INFO ]: Start difference. First operand 57 states and 193 transitions. Second operand 4 states. [2018-06-22 11:42:26,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:26,483 INFO ]: Finished difference Result 67 states and 232 transitions. [2018-06-22 11:42:26,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:26,484 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:26,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:26,487 INFO ]: With dead ends: 67 [2018-06-22 11:42:26,487 INFO ]: Without dead ends: 67 [2018-06-22 11:42:26,487 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-22 11:42:26,487 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:42:26,504 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 59. [2018-06-22 11:42:26,504 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:42:26,506 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 184 transitions. [2018-06-22 11:42:26,506 INFO ]: Start accepts. Automaton has 59 states and 184 transitions. Word has length 13 [2018-06-22 11:42:26,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:26,507 INFO ]: Abstraction has 59 states and 184 transitions. [2018-06-22 11:42:26,507 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:26,507 INFO ]: Start isEmpty. Operand 59 states and 184 transitions. [2018-06-22 11:42:26,511 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:26,511 INFO ]: Found error trace [2018-06-22 11:42:26,511 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:26,511 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:26,511 INFO ]: Analyzing trace with hash 760247209, now seen corresponding path program 1 times [2018-06-22 11:42:26,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:26,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:26,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:26,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:26,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:26,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:26,555 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:42:26,555 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:26,555 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:26,556 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:26,556 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:26,556 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:26,556 INFO ]: Start difference. First operand 59 states and 184 transitions. Second operand 4 states. [2018-06-22 11:42:27,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:27,171 INFO ]: Finished difference Result 69 states and 223 transitions. [2018-06-22 11:42:27,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:27,171 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:27,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:27,173 INFO ]: With dead ends: 69 [2018-06-22 11:42:27,173 INFO ]: Without dead ends: 69 [2018-06-22 11:42:27,173 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-22 11:42:27,174 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:42:27,187 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 59. [2018-06-22 11:42:27,187 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:42:27,188 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 169 transitions. [2018-06-22 11:42:27,188 INFO ]: Start accepts. Automaton has 59 states and 169 transitions. Word has length 13 [2018-06-22 11:42:27,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:27,188 INFO ]: Abstraction has 59 states and 169 transitions. [2018-06-22 11:42:27,188 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:27,188 INFO ]: Start isEmpty. Operand 59 states and 169 transitions. [2018-06-22 11:42:27,191 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:27,191 INFO ]: Found error trace [2018-06-22 11:42:27,191 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:27,191 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:27,191 INFO ]: Analyzing trace with hash 514996356, now seen corresponding path program 1 times [2018-06-22 11:42:27,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:27,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:27,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:27,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:27,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:27,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:27,327 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:42:27,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:27,327 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:42:27,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:27,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:27,373 INFO ]: Computing forward predicates... [2018-06-22 11:42:27,740 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:42:27,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:27,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:42:27,772 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:42:27,773 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:42:27,773 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:42:27,773 INFO ]: Start difference. First operand 59 states and 169 transitions. Second operand 8 states. [2018-06-22 11:42:28,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:28,422 INFO ]: Finished difference Result 85 states and 283 transitions. [2018-06-22 11:42:28,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:28,422 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:42:28,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:28,425 INFO ]: With dead ends: 85 [2018-06-22 11:42:28,425 INFO ]: Without dead ends: 85 [2018-06-22 11:42:28,425 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:28,425 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:42:28,442 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-06-22 11:42:28,477 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:42:28,479 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 201 transitions. [2018-06-22 11:42:28,479 INFO ]: Start accepts. Automaton has 67 states and 201 transitions. Word has length 13 [2018-06-22 11:42:28,479 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:28,479 INFO ]: Abstraction has 67 states and 201 transitions. [2018-06-22 11:42:28,479 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:42:28,479 INFO ]: Start isEmpty. Operand 67 states and 201 transitions. [2018-06-22 11:42:28,482 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:28,482 INFO ]: Found error trace [2018-06-22 11:42:28,482 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:28,482 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:28,482 INFO ]: Analyzing trace with hash -836960704, now seen corresponding path program 1 times [2018-06-22 11:42:28,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:28,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:28,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:28,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:28,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:28,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:28,637 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:42:28,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:28,637 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:42:28,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:28,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:28,678 INFO ]: Computing forward predicates... [2018-06-22 11:42:28,842 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:42:28,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:28,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:42:28,890 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:42:28,890 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:42:28,890 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:42:28,890 INFO ]: Start difference. First operand 67 states and 201 transitions. Second operand 8 states. [2018-06-22 11:42:29,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:29,390 INFO ]: Finished difference Result 105 states and 375 transitions. [2018-06-22 11:42:29,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:42:29,390 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:42:29,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:29,393 INFO ]: With dead ends: 105 [2018-06-22 11:42:29,393 INFO ]: Without dead ends: 105 [2018-06-22 11:42:29,393 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:29,393 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:42:29,430 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-06-22 11:42:29,430 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:42:29,434 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 245 transitions. [2018-06-22 11:42:29,434 INFO ]: Start accepts. Automaton has 77 states and 245 transitions. Word has length 13 [2018-06-22 11:42:29,434 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:29,434 INFO ]: Abstraction has 77 states and 245 transitions. [2018-06-22 11:42:29,434 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:42:29,434 INFO ]: Start isEmpty. Operand 77 states and 245 transitions. [2018-06-22 11:42:29,437 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:29,437 INFO ]: Found error trace [2018-06-22 11:42:29,437 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:29,437 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:29,437 INFO ]: Analyzing trace with hash 269745503, now seen corresponding path program 1 times [2018-06-22 11:42:29,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:29,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:29,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:29,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:29,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:29,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:29,623 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:42:29,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:29,623 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:42:29,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:29,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:29,661 INFO ]: Computing forward predicates... [2018-06-22 11:42:29,749 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:42:29,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:29,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:42:29,791 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:42:29,792 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:42:29,792 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:42:29,792 INFO ]: Start difference. First operand 77 states and 245 transitions. Second operand 9 states. [2018-06-22 11:42:30,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:30,150 INFO ]: Finished difference Result 81 states and 257 transitions. [2018-06-22 11:42:30,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:30,151 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:42:30,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:30,152 INFO ]: With dead ends: 81 [2018-06-22 11:42:30,152 INFO ]: Without dead ends: 81 [2018-06-22 11:42:30,152 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:30,152 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:42:30,163 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-22 11:42:30,163 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:42:30,164 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 257 transitions. [2018-06-22 11:42:30,164 INFO ]: Start accepts. Automaton has 81 states and 257 transitions. Word has length 13 [2018-06-22 11:42:30,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:30,165 INFO ]: Abstraction has 81 states and 257 transitions. [2018-06-22 11:42:30,165 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:42:30,165 INFO ]: Start isEmpty. Operand 81 states and 257 transitions. [2018-06-22 11:42:30,168 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:30,168 INFO ]: Found error trace [2018-06-22 11:42:30,168 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:30,168 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:30,168 INFO ]: Analyzing trace with hash 1175347581, now seen corresponding path program 1 times [2018-06-22 11:42:30,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:30,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:30,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:30,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:30,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:30,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:30,213 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:42:30,213 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:30,213 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:30,213 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:30,213 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:30,213 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:30,213 INFO ]: Start difference. First operand 81 states and 257 transitions. Second operand 4 states. [2018-06-22 11:42:30,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:30,540 INFO ]: Finished difference Result 53 states and 112 transitions. [2018-06-22 11:42:30,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:30,540 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:30,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:30,541 INFO ]: With dead ends: 53 [2018-06-22 11:42:30,541 INFO ]: Without dead ends: 25 [2018-06-22 11:42:30,541 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-22 11:42:30,541 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:42:30,544 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:42:30,545 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:42:30,545 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2018-06-22 11:42:30,545 INFO ]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 13 [2018-06-22 11:42:30,545 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:30,545 INFO ]: Abstraction has 23 states and 40 transitions. [2018-06-22 11:42:30,545 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:30,545 INFO ]: Start isEmpty. Operand 23 states and 40 transitions. [2018-06-22 11:42:30,546 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:30,546 INFO ]: Found error trace [2018-06-22 11:42:30,546 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:30,546 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:30,546 INFO ]: Analyzing trace with hash 2100321097, now seen corresponding path program 1 times [2018-06-22 11:42:30,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:30,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:30,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:30,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:30,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:30,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:30,651 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:30,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:30,651 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:42:30,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:30,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:30,690 INFO ]: Computing forward predicates... [2018-06-22 11:42:30,865 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:30,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:30,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:42:30,885 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:42:30,885 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:42:30,885 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:42:30,885 INFO ]: Start difference. First operand 23 states and 40 transitions. Second operand 12 states. [2018-06-22 11:42:31,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:31,147 INFO ]: Finished difference Result 35 states and 64 transitions. [2018-06-22 11:42:31,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:42:31,147 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:42:31,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:31,148 INFO ]: With dead ends: 35 [2018-06-22 11:42:31,148 INFO ]: Without dead ends: 35 [2018-06-22 11:42:31,148 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:42:31,148 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:42:31,152 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 11:42:31,152 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:42:31,152 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2018-06-22 11:42:31,152 INFO ]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 17 [2018-06-22 11:42:31,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:31,152 INFO ]: Abstraction has 29 states and 52 transitions. [2018-06-22 11:42:31,152 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:42:31,152 INFO ]: Start isEmpty. Operand 29 states and 52 transitions. [2018-06-22 11:42:31,153 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:31,153 INFO ]: Found error trace [2018-06-22 11:42:31,153 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:31,153 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:31,153 INFO ]: Analyzing trace with hash -50290171, now seen corresponding path program 1 times [2018-06-22 11:42:31,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:31,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:31,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:31,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:31,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:31,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:31,300 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:31,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:31,301 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:42:31,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:31,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:31,334 INFO ]: Computing forward predicates... [2018-06-22 11:42:31,464 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:31,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:31,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:42:31,485 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:42:31,485 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:42:31,485 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:42:31,485 INFO ]: Start difference. First operand 29 states and 52 transitions. Second operand 12 states. [2018-06-22 11:42:31,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:31,768 INFO ]: Finished difference Result 39 states and 72 transitions. [2018-06-22 11:42:31,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:42:31,768 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:42:31,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:31,769 INFO ]: With dead ends: 39 [2018-06-22 11:42:31,769 INFO ]: Without dead ends: 39 [2018-06-22 11:42:31,769 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:42:31,769 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:42:31,772 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-06-22 11:42:31,772 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:42:31,773 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. [2018-06-22 11:42:31,773 INFO ]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 17 [2018-06-22 11:42:31,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:31,773 INFO ]: Abstraction has 31 states and 56 transitions. [2018-06-22 11:42:31,773 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:42:31,773 INFO ]: Start isEmpty. Operand 31 states and 56 transitions. [2018-06-22 11:42:31,774 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:31,774 INFO ]: Found error trace [2018-06-22 11:42:31,774 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:31,774 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:31,774 INFO ]: Analyzing trace with hash 1399826185, now seen corresponding path program 2 times [2018-06-22 11:42:31,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:31,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:31,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:31,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:31,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:31,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:31,991 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:32,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:32,018 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:42:32,024 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:32,063 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:32,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,066 INFO ]: Computing forward predicates... [2018-06-22 11:42:32,178 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:42:32,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:32,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:42:32,198 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:32,198 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:32,198 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:32,198 INFO ]: Start difference. First operand 31 states and 56 transitions. Second operand 11 states. [2018-06-22 11:42:32,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:32,355 INFO ]: Finished difference Result 37 states and 69 transitions. [2018-06-22 11:42:32,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:42:32,355 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:42:32,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:32,355 INFO ]: With dead ends: 37 [2018-06-22 11:42:32,355 INFO ]: Without dead ends: 37 [2018-06-22 11:42:32,356 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:42:32,356 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:42:32,358 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:42:32,358 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:42:32,359 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 61 transitions. [2018-06-22 11:42:32,359 INFO ]: Start accepts. Automaton has 33 states and 61 transitions. Word has length 17 [2018-06-22 11:42:32,359 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:32,359 INFO ]: Abstraction has 33 states and 61 transitions. [2018-06-22 11:42:32,359 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:32,359 INFO ]: Start isEmpty. Operand 33 states and 61 transitions. [2018-06-22 11:42:32,359 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:32,359 INFO ]: Found error trace [2018-06-22 11:42:32,359 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:32,360 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:32,360 INFO ]: Analyzing trace with hash -566789435, now seen corresponding path program 2 times [2018-06-22 11:42:32,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:32,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:32,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:32,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,571 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:32,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:32,571 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-22 11:42:32,577 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:32,595 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:32,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,598 INFO ]: Computing forward predicates... [2018-06-22 11:42:32,702 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:42:32,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:32,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:42:32,721 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:32,721 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:32,721 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:32,721 INFO ]: Start difference. First operand 33 states and 61 transitions. Second operand 11 states. [2018-06-22 11:42:32,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:32,875 INFO ]: Finished difference Result 37 states and 68 transitions. [2018-06-22 11:42:32,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:42:32,875 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:42:32,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:32,875 INFO ]: With dead ends: 37 [2018-06-22 11:42:32,875 INFO ]: Without dead ends: 37 [2018-06-22 11:42:32,875 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:42:32,875 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:42:32,878 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-06-22 11:42:32,878 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:42:32,878 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2018-06-22 11:42:32,878 INFO ]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 17 [2018-06-22 11:42:32,878 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:32,878 INFO ]: Abstraction has 27 states and 47 transitions. [2018-06-22 11:42:32,878 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:32,878 INFO ]: Start isEmpty. Operand 27 states and 47 transitions. [2018-06-22 11:42:32,879 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:32,879 INFO ]: Found error trace [2018-06-22 11:42:32,879 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:32,879 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:32,879 INFO ]: Analyzing trace with hash -1657514652, now seen corresponding path program 2 times [2018-06-22 11:42:32,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:32,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:32,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:32,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:33,158 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:33,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:33,159 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-22 11:42:33,165 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:33,184 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:33,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:33,187 INFO ]: Computing forward predicates... [2018-06-22 11:42:33,323 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:33,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:33,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:42:33,342 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:42:33,342 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:42:33,342 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:42:33,342 INFO ]: Start difference. First operand 27 states and 47 transitions. Second operand 13 states. [2018-06-22 11:42:33,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:33,775 INFO ]: Finished difference Result 33 states and 59 transitions. [2018-06-22 11:42:33,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:33,776 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:42:33,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:33,776 INFO ]: With dead ends: 33 [2018-06-22 11:42:33,776 INFO ]: Without dead ends: 33 [2018-06-22 11:42:33,776 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:42:33,777 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:42:33,779 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-06-22 11:42:33,779 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:42:33,779 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2018-06-22 11:42:33,779 INFO ]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 17 [2018-06-22 11:42:33,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:33,779 INFO ]: Abstraction has 21 states and 34 transitions. [2018-06-22 11:42:33,779 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:42:33,779 INFO ]: Start isEmpty. Operand 21 states and 34 transitions. [2018-06-22 11:42:33,780 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:33,780 INFO ]: Found error trace [2018-06-22 11:42:33,780 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:33,780 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:33,780 INFO ]: Analyzing trace with hash 1687067982, now seen corresponding path program 3 times [2018-06-22 11:42:33,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:33,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:33,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:33,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:34,116 INFO ]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:42:34,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:34,119 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-22 11:42:34,125 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:42:34,143 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:42:34,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:34,145 INFO ]: Computing forward predicates... [2018-06-22 11:42:34,183 INFO ]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:42:34,215 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:42:34,252 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-06-22 11:42:34,253 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:34,253 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:34,253 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:34,253 INFO ]: Start difference. First operand 21 states and 34 transitions. Second operand 11 states. [2018-06-22 11:42:34,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:34,486 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-22 11:42:34,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:34,486 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:42:34,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:34,486 INFO ]: With dead ends: 13 [2018-06-22 11:42:34,486 INFO ]: Without dead ends: 0 [2018-06-22 11:42:34,487 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:42:34,487 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:42:34,487 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:42:34,487 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:42:34,487 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:42:34,487 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:42:34,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:34,487 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:42:34,487 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:34,487 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:42:34,487 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:42:34,494 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:42:34 BoogieIcfgContainer [2018-06-22 11:42:34,494 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:42:34,495 INFO ]: Toolchain (without parser) took 12613.96 ms. Allocated memory was 308.8 MB in the beginning and 417.9 MB in the end (delta: 109.1 MB). Free memory was 251.3 MB in the beginning and 208.3 MB in the end (delta: 43.0 MB). Peak memory consumption was 152.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:34,496 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:42:34,496 INFO ]: ChcToBoogie took 94.68 ms. Allocated memory is still 308.8 MB. Free memory was 251.3 MB in the beginning and 249.3 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:42:34,497 INFO ]: Boogie Preprocessor took 52.59 ms. Allocated memory is still 308.8 MB. Free memory was 249.3 MB in the beginning and 245.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:34,497 INFO ]: RCFGBuilder took 871.66 ms. Allocated memory is still 308.8 MB. Free memory was 245.3 MB in the beginning and 219.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:34,497 INFO ]: TraceAbstraction took 11585.56 ms. Allocated memory was 308.8 MB in the beginning and 417.9 MB in the end (delta: 109.1 MB). Free memory was 219.3 MB in the beginning and 208.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:34,500 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.68 ms. Allocated memory is still 308.8 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.59 ms. Allocated memory is still 308.8 MB. Free memory was 249.3 MB in the beginning and 245.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 871.66 ms. Allocated memory is still 308.8 MB. Free memory was 245.3 MB in the beginning and 219.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11585.56 ms. Allocated memory was 308.8 MB in the beginning and 417.9 MB in the end (delta: 109.1 MB). Free memory was 219.3 MB in the beginning and 208.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 120.0 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, 36 locations, 1 error locations. SAFE Result, 11.5s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 601 SDtfs, 102 SDslu, 762 SDs, 0 SdLazy, 2704 SolverSat, 214 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 118 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 377 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 352 ConstructedInterpolants, 4 QuantifiedInterpolants, 27924 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1417 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 99/166 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/heap__cocome2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-42-34-513.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__cocome2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-42-34-513.csv Received shutdown request...