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/eldarica-misc/LIA/reve/013b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:15:13,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:15:13,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:15:13,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:15:13,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:15:13,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:15:13,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:15:13,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:15:13,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:15:13,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:15:13,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:15:13,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:15:13,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:15:13,133 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:15:13,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:15:13,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:15:13,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:15:13,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:15:13,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:15:13,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:15:13,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:15:13,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:15:13,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:15:13,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:15:13,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:15:13,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:15:13,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:15:13,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:15:13,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:15:13,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:15:13,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:15:13,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:15:13,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:15:13,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:15:13,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:15:13,153 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:15:13,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:15:13,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:15:13,167 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:15:13,167 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:15:13,168 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:15:13,168 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:15:13,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:15:13,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:15:13,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:15:13,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:15:13,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:15:13,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:15:13,170 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:15:13,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:15:13,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:15:13,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:15:13,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:15:13,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:15:13,171 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:15:13,172 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:15:13,173 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:15:13,217 INFO ]: Repository-Root is: /tmp [2018-06-22 11:15:13,233 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:15:13,236 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:15:13,237 INFO ]: Initializing SmtParser... [2018-06-22 11:15:13,237 INFO ]: SmtParser initialized [2018-06-22 11:15:13,238 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 [2018-06-22 11:15:13,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:15:13,322 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 unknown [2018-06-22 11:15:13,545 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 [2018-06-22 11:15:13,549 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:15:13,556 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:15:13,557 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:15:13,557 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:15:13,557 INFO ]: ChcToBoogie initialized [2018-06-22 11:15:13,560 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,604 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13 Unit [2018-06-22 11:15:13,605 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:15:13,605 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:15:13,605 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:15:13,605 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:15:13,627 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,627 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,635 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,635 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,639 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,641 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,642 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (1/1) ... [2018-06-22 11:15:13,649 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:15:13,650 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:15:13,650 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:15:13,650 INFO ]: RCFGBuilder initialized [2018-06-22 11:15:13,651 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (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:15:13,665 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:15:13,665 INFO ]: Found specification of procedure False [2018-06-22 11:15:13,665 INFO ]: Found implementation of procedure False [2018-06-22 11:15:13,666 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:15:13,666 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:15:13,666 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:15:13,666 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:15:13,666 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:15:13,666 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:15:13,666 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:15:13,666 INFO ]: Found specification of procedure REC__f [2018-06-22 11:15:13,666 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:15:13,666 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:15:13,666 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:15:13,666 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:15:14,040 INFO ]: Using library mode [2018-06-22 11:15:14,041 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:15:14 BoogieIcfgContainer [2018-06-22 11:15:14,041 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:15:14,042 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:15:14,042 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:15:14,045 INFO ]: TraceAbstraction initialized [2018-06-22 11:15:14,045 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:15:13" (1/3) ... [2018-06-22 11:15:14,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ca92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:15:14, skipping insertion in model container [2018-06-22 11:15:14,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:13" (2/3) ... [2018-06-22 11:15:14,046 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ca92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:15:14, skipping insertion in model container [2018-06-22 11:15:14,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:15:14" (3/3) ... [2018-06-22 11:15:14,048 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:15:14,057 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:15:14,065 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:15:14,100 INFO ]: Using default assertion order modulation [2018-06-22 11:15:14,101 INFO ]: Interprodecural is true [2018-06-22 11:15:14,101 INFO ]: Hoare is false [2018-06-22 11:15:14,101 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:15:14,101 INFO ]: Backedges is TWOTRACK [2018-06-22 11:15:14,101 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:15:14,101 INFO ]: Difference is false [2018-06-22 11:15:14,101 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:15:14,101 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:15:14,118 INFO ]: Start isEmpty. Operand 27 states. [2018-06-22 11:15:14,137 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:15:14,137 INFO ]: Found error trace [2018-06-22 11:15:14,138 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:15:14,138 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:14,142 INFO ]: Analyzing trace with hash 111576821, now seen corresponding path program 1 times [2018-06-22 11:15:14,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:14,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:14,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:14,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:14,217 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:15:14,219 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:14,219 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:15:14,220 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:15:14,231 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:15:14,231 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:15:14,233 INFO ]: Start difference. First operand 27 states. Second operand 2 states. [2018-06-22 11:15:14,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:14,254 INFO ]: Finished difference Result 23 states and 36 transitions. [2018-06-22 11:15:14,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:15:14,255 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:15:14,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:14,268 INFO ]: With dead ends: 23 [2018-06-22 11:15:14,268 INFO ]: Without dead ends: 23 [2018-06-22 11:15:14,270 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:15:14,283 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:15:14,305 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:15:14,306 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:14,307 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 11:15:14,308 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 5 [2018-06-22 11:15:14,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:14,308 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 11:15:14,308 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:15:14,309 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 11:15:14,310 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:14,310 INFO ]: Found error trace [2018-06-22 11:15:14,310 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:14,310 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:14,311 INFO ]: Analyzing trace with hash 159025101, now seen corresponding path program 1 times [2018-06-22 11:15:14,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:14,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:14,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:14,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:14,434 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:15:14,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:14,434 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:14,435 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:14,435 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:14,435 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:14,436 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2018-06-22 11:15:14,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:14,479 INFO ]: Finished difference Result 27 states and 42 transitions. [2018-06-22 11:15:14,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:14,480 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:14,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:14,481 INFO ]: With dead ends: 27 [2018-06-22 11:15:14,481 INFO ]: Without dead ends: 27 [2018-06-22 11:15:14,482 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:15:14,482 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:15:14,492 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:15:14,492 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:14,493 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-06-22 11:15:14,493 INFO ]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 9 [2018-06-22 11:15:14,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:14,493 INFO ]: Abstraction has 25 states and 40 transitions. [2018-06-22 11:15:14,493 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:14,493 INFO ]: Start isEmpty. Operand 25 states and 40 transitions. [2018-06-22 11:15:14,495 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:14,495 INFO ]: Found error trace [2018-06-22 11:15:14,495 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:14,495 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:14,495 INFO ]: Analyzing trace with hash -1220389038, now seen corresponding path program 1 times [2018-06-22 11:15:14,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:14,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:14,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:14,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:14,636 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:15:14,637 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:14,637 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:14,637 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:14,637 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:14,637 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:14,637 INFO ]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2018-06-22 11:15:14,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:14,731 INFO ]: Finished difference Result 29 states and 44 transitions. [2018-06-22 11:15:14,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:14,733 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:14,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:14,734 INFO ]: With dead ends: 29 [2018-06-22 11:15:14,734 INFO ]: Without dead ends: 29 [2018-06-22 11:15:14,734 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:15:14,734 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:15:14,745 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:15:14,745 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:14,746 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:15:14,746 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 9 [2018-06-22 11:15:14,747 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:14,747 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:15:14,747 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:14,747 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:15:14,749 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:14,749 INFO ]: Found error trace [2018-06-22 11:15:14,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:14,749 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:14,750 INFO ]: Analyzing trace with hash -1420793095, now seen corresponding path program 1 times [2018-06-22 11:15:14,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:14,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:14,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:14,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:14,815 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:15:14,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:14,815 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:14,816 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:14,816 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:14,816 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:14,816 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2018-06-22 11:15:14,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:14,957 INFO ]: Finished difference Result 31 states and 46 transitions. [2018-06-22 11:15:14,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:14,959 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:14,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:14,960 INFO ]: With dead ends: 31 [2018-06-22 11:15:14,960 INFO ]: Without dead ends: 31 [2018-06-22 11:15:14,960 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:15:14,960 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:15:14,969 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:15:14,969 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:14,972 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:15:14,973 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 9 [2018-06-22 11:15:14,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:14,973 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:15:14,973 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:14,973 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:15:14,974 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:14,974 INFO ]: Found error trace [2018-06-22 11:15:14,974 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:14,974 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:14,974 INFO ]: Analyzing trace with hash -573353809, now seen corresponding path program 1 times [2018-06-22 11:15:14,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:14,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:14,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:14,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:14,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:15,042 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:15:15,042 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:15,042 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:15,042 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:15,042 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:15,042 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:15,043 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2018-06-22 11:15:15,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:15,091 INFO ]: Finished difference Result 27 states and 41 transitions. [2018-06-22 11:15:15,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:15,091 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:15:15,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:15,092 INFO ]: With dead ends: 27 [2018-06-22 11:15:15,092 INFO ]: Without dead ends: 26 [2018-06-22 11:15:15,092 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:15:15,093 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:15:15,096 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:15:15,096 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:15,097 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-06-22 11:15:15,097 INFO ]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-06-22 11:15:15,097 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:15,097 INFO ]: Abstraction has 24 states and 35 transitions. [2018-06-22 11:15:15,097 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:15,097 INFO ]: Start isEmpty. Operand 24 states and 35 transitions. [2018-06-22 11:15:15,098 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:15,098 INFO ]: Found error trace [2018-06-22 11:15:15,098 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:15,098 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:15,098 INFO ]: Analyzing trace with hash 2019304662, now seen corresponding path program 1 times [2018-06-22 11:15:15,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:15,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:15,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:15,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:15,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:15,120 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:15,234 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:15:15,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:15,234 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:15:15,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:15,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:15,292 INFO ]: Computing forward predicates... [2018-06-22 11:15:15,907 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:15:15,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:15,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:15:15,928 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:15:15,928 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:15:15,928 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:15:15,928 INFO ]: Start difference. First operand 24 states and 35 transitions. Second operand 10 states. [2018-06-22 11:15:16,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:16,244 INFO ]: Finished difference Result 30 states and 42 transitions. [2018-06-22 11:15:16,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:16,245 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:15:16,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:16,246 INFO ]: With dead ends: 30 [2018-06-22 11:15:16,246 INFO ]: Without dead ends: 30 [2018-06-22 11:15:16,246 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:15:16,246 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:15:16,251 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:15:16,251 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:16,252 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-06-22 11:15:16,252 INFO ]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2018-06-22 11:15:16,253 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:16,253 INFO ]: Abstraction has 26 states and 37 transitions. [2018-06-22 11:15:16,253 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:15:16,253 INFO ]: Start isEmpty. Operand 26 states and 37 transitions. [2018-06-22 11:15:16,253 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:16,253 INFO ]: Found error trace [2018-06-22 11:15:16,254 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:16,254 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:16,254 INFO ]: Analyzing trace with hash -1590433091, now seen corresponding path program 1 times [2018-06-22 11:15:16,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:16,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:16,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:16,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:16,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:16,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:16,383 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:16,384 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:16,384 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:15:16,384 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:15:16,384 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:15:16,384 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:15:16,384 INFO ]: Start difference. First operand 26 states and 37 transitions. Second operand 5 states. [2018-06-22 11:15:16,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:16,726 INFO ]: Finished difference Result 32 states and 44 transitions. [2018-06-22 11:15:16,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:16,727 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:15:16,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:16,728 INFO ]: With dead ends: 32 [2018-06-22 11:15:16,728 INFO ]: Without dead ends: 23 [2018-06-22 11:15:16,728 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:16,728 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:15:16,739 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:15:16,739 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:15:16,740 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 11:15:16,740 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2018-06-22 11:15:16,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:16,740 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 11:15:16,740 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:15:16,740 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 11:15:16,740 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:16,740 INFO ]: Found error trace [2018-06-22 11:15:16,741 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:16,741 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:16,741 INFO ]: Analyzing trace with hash 1865428199, now seen corresponding path program 1 times [2018-06-22 11:15:16,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:16,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:16,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:16,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:16,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:16,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:17,139 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:15:17,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:17,140 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:15:17,140 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:15:17,140 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:15:17,140 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:17,140 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 6 states. [2018-06-22 11:15:17,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:17,220 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-22 11:15:17,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:17,220 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:15:17,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:17,221 INFO ]: With dead ends: 27 [2018-06-22 11:15:17,221 INFO ]: Without dead ends: 27 [2018-06-22 11:15:17,221 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:17,221 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:15:17,225 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:15:17,225 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:17,226 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-06-22 11:15:17,226 INFO ]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2018-06-22 11:15:17,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:17,226 INFO ]: Abstraction has 23 states and 31 transitions. [2018-06-22 11:15:17,226 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:15:17,226 INFO ]: Start isEmpty. Operand 23 states and 31 transitions. [2018-06-22 11:15:17,227 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:17,227 INFO ]: Found error trace [2018-06-22 11:15:17,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:17,227 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:17,227 INFO ]: Analyzing trace with hash 1620177346, now seen corresponding path program 1 times [2018-06-22 11:15:17,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:17,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:17,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:17,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:17,280 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:15:17,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:17,280 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:17,280 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:17,280 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:17,280 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:17,281 INFO ]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-06-22 11:15:17,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:17,300 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-22 11:15:17,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:17,300 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:15:17,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:17,301 INFO ]: With dead ends: 25 [2018-06-22 11:15:17,301 INFO ]: Without dead ends: 25 [2018-06-22 11:15:17,301 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:15:17,301 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:15:17,305 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:15:17,305 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:17,305 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-06-22 11:15:17,305 INFO ]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2018-06-22 11:15:17,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:17,306 INFO ]: Abstraction has 23 states and 31 transitions. [2018-06-22 11:15:17,306 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:17,306 INFO ]: Start isEmpty. Operand 23 states and 31 transitions. [2018-06-22 11:15:17,306 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:17,306 INFO ]: Found error trace [2018-06-22 11:15:17,306 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:17,306 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:17,307 INFO ]: Analyzing trace with hash 1075449562, now seen corresponding path program 2 times [2018-06-22 11:15:17,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:17,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:17,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:17,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,337 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:17,589 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:17,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:17,589 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:15:17,605 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:15:17,626 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:15:17,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:17,629 INFO ]: Computing forward predicates... [2018-06-22 11:15:17,762 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:15:17,784 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:17,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 11:15:17,785 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:15:17,785 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:15:17,785 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:15:17,785 INFO ]: Start difference. First operand 23 states and 31 transitions. Second operand 13 states. [2018-06-22 11:15:17,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:17,952 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 11:15:17,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:15:17,952 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:15:17,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:17,953 INFO ]: With dead ends: 29 [2018-06-22 11:15:17,953 INFO ]: Without dead ends: 29 [2018-06-22 11:15:17,953 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:15:17,953 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:15:17,957 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:15:17,957 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:17,958 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:15:17,958 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-22 11:15:17,958 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:17,958 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:15:17,958 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:15:17,958 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:15:17,959 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:17,959 INFO ]: Found error trace [2018-06-22 11:15:17,959 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:17,959 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:17,959 INFO ]: Analyzing trace with hash -770943317, now seen corresponding path program 1 times [2018-06-22 11:15:17,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:17,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:17,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,960 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:17,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:17,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:18,057 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:15:18,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:18,057 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:15:18,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:18,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:18,080 INFO ]: Computing forward predicates... [2018-06-22 11:15:18,246 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:15:18,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:18,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:15:18,280 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:15:18,280 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:15:18,281 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:15:18,281 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 13 states. [2018-06-22 11:15:18,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:18,660 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:15:18,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:18,661 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:15:18,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:18,662 INFO ]: With dead ends: 33 [2018-06-22 11:15:18,662 INFO ]: Without dead ends: 33 [2018-06-22 11:15:18,662 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:15:18,662 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:15:18,668 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-06-22 11:15:18,668 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:18,669 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:15:18,669 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-22 11:15:18,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:18,669 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:15:18,669 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:15:18,669 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:15:18,670 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:18,670 INFO ]: Found error trace [2018-06-22 11:15:18,670 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:18,670 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:18,670 INFO ]: Analyzing trace with hash -233811770, now seen corresponding path program 1 times [2018-06-22 11:15:18,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:18,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:18,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:18,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:18,750 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:18,750 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:18,750 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:15:18,750 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:15:18,750 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:15:18,750 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:15:18,750 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 5 states. [2018-06-22 11:15:18,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:18,791 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:15:18,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:18,791 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:15:18,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:18,791 INFO ]: With dead ends: 33 [2018-06-22 11:15:18,791 INFO ]: Without dead ends: 28 [2018-06-22 11:15:18,792 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:18,792 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:15:18,795 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:15:18,795 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:18,795 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-22 11:15:18,795 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2018-06-22 11:15:18,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:18,795 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-22 11:15:18,795 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:15:18,795 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-22 11:15:18,796 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:18,796 INFO ]: Found error trace [2018-06-22 11:15:18,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:18,796 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:18,796 INFO ]: Analyzing trace with hash 967269321, now seen corresponding path program 1 times [2018-06-22 11:15:18,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:18,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:18,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:18,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:18,876 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:15:18,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:18,876 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:15:18,877 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:15:18,877 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:15:18,877 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:18,877 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-06-22 11:15:18,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:18,903 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-22 11:15:18,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:18,903 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:15:18,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:18,903 INFO ]: With dead ends: 28 [2018-06-22 11:15:18,903 INFO ]: Without dead ends: 28 [2018-06-22 11:15:18,904 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:18,904 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:15:18,906 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:15:18,906 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:18,907 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-22 11:15:18,907 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2018-06-22 11:15:18,907 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:18,907 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-22 11:15:18,907 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:15:18,907 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-22 11:15:18,907 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:18,907 INFO ]: Found error trace [2018-06-22 11:15:18,908 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:18,908 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:18,909 INFO ]: Analyzing trace with hash 611595614, now seen corresponding path program 3 times [2018-06-22 11:15:18,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:18,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:18,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:18,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:18,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:19,133 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:15:19,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:19,133 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:15:19,142 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:15:19,157 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:15:19,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:19,160 INFO ]: Computing forward predicates... [2018-06-22 11:15:19,272 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:15:19,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:19,301 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:15:19,301 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:15:19,301 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:15:19,302 INFO ]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:15:19,302 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 16 states. [2018-06-22 11:15:19,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:19,524 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 11:15:19,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:19,525 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:15:19,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:19,526 INFO ]: With dead ends: 32 [2018-06-22 11:15:19,526 INFO ]: Without dead ends: 32 [2018-06-22 11:15:19,526 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:15:19,526 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:15:19,530 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:15:19,530 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:19,530 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 11:15:19,530 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-06-22 11:15:19,530 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:19,530 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 11:15:19,530 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:15:19,530 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 11:15:19,531 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:19,531 INFO ]: Found error trace [2018-06-22 11:15:19,531 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:19,531 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:19,531 INFO ]: Analyzing trace with hash 49532143, now seen corresponding path program 2 times [2018-06-22 11:15:19,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:19,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:19,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:19,532 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:19,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:19,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:19,696 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:19,696 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:19,721 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:15:19,732 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:15:19,742 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:15:19,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:19,745 INFO ]: Computing forward predicates... [2018-06-22 11:15:20,066 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:20,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:20,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:15:20,098 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:15:20,098 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:15:20,098 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:15:20,098 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 17 states. [2018-06-22 11:15:20,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:20,333 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-22 11:15:20,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:15:20,333 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:15:20,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:20,334 INFO ]: With dead ends: 34 [2018-06-22 11:15:20,334 INFO ]: Without dead ends: 34 [2018-06-22 11:15:20,334 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:15:20,334 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:15:20,337 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-06-22 11:15:20,337 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:20,338 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 11:15:20,338 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-06-22 11:15:20,338 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:20,338 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 11:15:20,338 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:15:20,338 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 11:15:20,339 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:20,339 INFO ]: Found error trace [2018-06-22 11:15:20,339 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:20,339 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:20,339 INFO ]: Analyzing trace with hash -270400883, now seen corresponding path program 1 times [2018-06-22 11:15:20,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:20,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:20,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:20,339 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:20,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:20,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:20,436 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:15:20,436 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:20,436 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:15:20,436 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:15:20,436 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:15:20,436 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:20,436 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2018-06-22 11:15:20,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:20,552 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 11:15:20,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:20,553 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:15:20,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:20,553 INFO ]: With dead ends: 32 [2018-06-22 11:15:20,553 INFO ]: Without dead ends: 25 [2018-06-22 11:15:20,554 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:15:20,554 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:15:20,556 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:15:20,556 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:20,556 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-22 11:15:20,556 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2018-06-22 11:15:20,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:20,556 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-22 11:15:20,556 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:15:20,556 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-22 11:15:20,557 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:15:20,557 INFO ]: Found error trace [2018-06-22 11:15:20,558 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:20,558 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:20,558 INFO ]: Analyzing trace with hash 356169826, now seen corresponding path program 4 times [2018-06-22 11:15:20,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:20,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:20,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:20,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:20,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:20,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:21,799 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:15:21,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:21,800 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:15:21,805 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:15:21,838 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:15:21,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:21,842 INFO ]: Computing forward predicates... [2018-06-22 11:15:22,241 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:15:22,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:22,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-06-22 11:15:22,261 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:15:22,261 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:15:22,261 INFO ]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:15:22,261 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 19 states. [2018-06-22 11:15:22,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:22,589 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-22 11:15:22,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:15:22,589 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:15:22,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:22,590 INFO ]: With dead ends: 31 [2018-06-22 11:15:22,590 INFO ]: Without dead ends: 31 [2018-06-22 11:15:22,590 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:15:22,590 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:15:22,591 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:15:22,591 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:22,592 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 11:15:22,592 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2018-06-22 11:15:22,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:22,592 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 11:15:22,592 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:15:22,592 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 11:15:22,592 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:15:22,592 INFO ]: Found error trace [2018-06-22 11:15:22,592 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:22,592 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:22,592 INFO ]: Analyzing trace with hash 1379053491, now seen corresponding path program 3 times [2018-06-22 11:15:22,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:22,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:22,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:22,593 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:22,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:22,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:22,786 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:15:22,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:22,786 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:15:22,792 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:15:22,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:15:22,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:22,808 INFO ]: Computing forward predicates... [2018-06-22 11:15:23,127 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:15:23,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:23,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:15:23,158 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:15:23,158 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:15:23,158 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:15:23,158 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 20 states. [2018-06-22 11:15:23,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:23,390 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-22 11:15:23,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:15:23,390 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:15:23,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:23,391 INFO ]: With dead ends: 33 [2018-06-22 11:15:23,391 INFO ]: Without dead ends: 33 [2018-06-22 11:15:23,391 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:15:23,391 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:15:23,393 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-06-22 11:15:23,393 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:23,394 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 11:15:23,394 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2018-06-22 11:15:23,394 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:23,394 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 11:15:23,394 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:15:23,394 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 11:15:23,394 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:15:23,394 INFO ]: Found error trace [2018-06-22 11:15:23,394 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:23,395 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:23,395 INFO ]: Analyzing trace with hash 370522086, now seen corresponding path program 5 times [2018-06-22 11:15:23,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:23,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:23,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:23,396 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:23,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:23,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:23,672 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:15:23,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:23,672 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:15:23,689 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:15:23,712 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:15:23,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:23,715 INFO ]: Computing forward predicates... [2018-06-22 11:15:24,180 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:15:24,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:24,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-06-22 11:15:24,199 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:15:24,200 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:15:24,200 INFO ]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:15:24,200 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 22 states. [2018-06-22 11:15:24,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:24,422 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 11:15:24,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:15:24,422 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:15:24,422 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:24,422 INFO ]: With dead ends: 35 [2018-06-22 11:15:24,422 INFO ]: Without dead ends: 35 [2018-06-22 11:15:24,423 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:15:24,423 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:15:24,426 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 11:15:24,426 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:24,426 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 11:15:24,426 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 29 [2018-06-22 11:15:24,428 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:24,428 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 11:15:24,428 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:15:24,428 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 11:15:24,429 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:15:24,429 INFO ]: Found error trace [2018-06-22 11:15:24,429 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:24,429 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:24,429 INFO ]: Analyzing trace with hash -185786633, now seen corresponding path program 4 times [2018-06-22 11:15:24,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:24,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:24,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:24,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:24,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:24,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:24,785 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:15:24,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:24,785 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:15:24,791 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:15:24,805 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:15:24,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:24,809 INFO ]: Computing forward predicates... [2018-06-22 11:15:25,233 INFO ]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:15:25,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:25,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-06-22 11:15:25,253 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:15:25,253 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:15:25,253 INFO ]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:15:25,253 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 23 states. [2018-06-22 11:15:25,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:25,630 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-22 11:15:25,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:15:25,631 INFO ]: Start accepts. Automaton has 23 states. Word has length 29 [2018-06-22 11:15:25,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:25,631 INFO ]: With dead ends: 37 [2018-06-22 11:15:25,631 INFO ]: Without dead ends: 37 [2018-06-22 11:15:25,632 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:15:25,632 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:15:25,634 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-06-22 11:15:25,634 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:25,635 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 11:15:25,635 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 29 [2018-06-22 11:15:25,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:25,635 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 11:15:25,635 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:15:25,635 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 11:15:25,635 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:15:25,635 INFO ]: Found error trace [2018-06-22 11:15:25,635 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:25,635 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:25,636 INFO ]: Analyzing trace with hash -125479958, now seen corresponding path program 6 times [2018-06-22 11:15:25,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:25,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:25,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:25,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:25,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:25,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:25,871 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:15:25,871 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:25,871 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:25,876 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:15:25,909 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:15:25,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:25,913 INFO ]: Computing forward predicates... [2018-06-22 11:15:26,196 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:15:26,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:26,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2018-06-22 11:15:26,216 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:15:26,216 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:15:26,216 INFO ]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:15:26,216 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2018-06-22 11:15:26,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,458 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-22 11:15:26,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:15:26,458 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:15:26,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,459 INFO ]: With dead ends: 39 [2018-06-22 11:15:26,459 INFO ]: Without dead ends: 39 [2018-06-22 11:15:26,459 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:15:26,459 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:15:26,462 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-22 11:15:26,462 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:15:26,462 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 11:15:26,462 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 33 [2018-06-22 11:15:26,462 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,462 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 11:15:26,462 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:15:26,462 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 11:15:26,463 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:15:26,463 INFO ]: Found error trace [2018-06-22 11:15:26,463 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,463 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,463 INFO ]: Analyzing trace with hash 2132753083, now seen corresponding path program 5 times [2018-06-22 11:15:26,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,464 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:26,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,830 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:15:26,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:26,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:26,837 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:15:26,855 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:15:26,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,859 INFO ]: Computing forward predicates... [2018-06-22 11:15:31,533 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:15:31,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:31,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-06-22 11:15:31,555 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:15:31,555 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:15:31,556 INFO ]: CoverageRelationStatistics Valid=75, Invalid=524, Unknown=1, NotChecked=0, Total=600 [2018-06-22 11:15:31,556 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 25 states. [2018-06-22 11:15:44,301 WARN ]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-06-22 11:15:53,025 WARN ]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 72 [2018-06-22 11:16:05,537 WARN ]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 80 [2018-06-22 11:16:09,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:09,921 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 11:16:09,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:16:09,922 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:16:09,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:09,923 INFO ]: With dead ends: 41 [2018-06-22 11:16:09,923 INFO ]: Without dead ends: 41 [2018-06-22 11:16:09,923 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=146, Invalid=777, Unknown=7, NotChecked=0, Total=930 [2018-06-22 11:16:09,923 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:16:09,926 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-22 11:16:09,926 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:16:09,926 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 11:16:09,926 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 33 [2018-06-22 11:16:09,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:09,927 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 11:16:09,927 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:16:09,927 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 11:16:09,927 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:09,927 INFO ]: Found error trace [2018-06-22 11:16:09,927 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:09,927 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:09,927 INFO ]: Analyzing trace with hash -1780372370, now seen corresponding path program 7 times [2018-06-22 11:16:09,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:09,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:09,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:09,928 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:09,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:09,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:10,291 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:10,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:10,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:16:10,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:10,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:10,352 INFO ]: Computing forward predicates... [2018-06-22 11:16:10,643 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:16:10,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:10,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2018-06-22 11:16:10,667 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:16:10,667 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:16:10,668 INFO ]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:16:10,668 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 28 states. [2018-06-22 11:16:11,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:11,151 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 11:16:11,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:16:11,156 INFO ]: Start accepts. Automaton has 28 states. Word has length 37 [2018-06-22 11:16:11,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:11,157 INFO ]: With dead ends: 43 [2018-06-22 11:16:11,157 INFO ]: Without dead ends: 43 [2018-06-22 11:16:11,157 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:11,157 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:16:11,159 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-06-22 11:16:11,160 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:11,161 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 11:16:11,161 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 37 [2018-06-22 11:16:11,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:11,161 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 11:16:11,161 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:16:11,161 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 11:16:11,162 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:11,162 INFO ]: Found error trace [2018-06-22 11:16:11,162 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:11,162 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:11,162 INFO ]: Analyzing trace with hash -576904449, now seen corresponding path program 6 times [2018-06-22 11:16:11,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:11,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:11,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:11,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:11,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:11,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:11,549 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:11,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:11,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:11,555 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:16:11,581 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:16:11,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:11,587 INFO ]: Computing forward predicates... [2018-06-22 11:16:12,207 INFO ]: Checked inductivity of 78 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:12,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:12,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-06-22 11:16:12,240 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:16:12,241 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:16:12,241 INFO ]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:16:12,241 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 29 states. [2018-06-22 11:16:13,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:13,254 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-22 11:16:13,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:16:13,254 INFO ]: Start accepts. Automaton has 29 states. Word has length 37 [2018-06-22 11:16:13,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:13,255 INFO ]: With dead ends: 45 [2018-06-22 11:16:13,255 INFO ]: Without dead ends: 45 [2018-06-22 11:16:13,255 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:16:13,256 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:16:13,258 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-22 11:16:13,258 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:13,258 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 11:16:13,258 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 37 [2018-06-22 11:16:13,258 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:13,258 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 11:16:13,258 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:16:13,258 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 11:16:13,259 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:16:13,259 INFO ]: Found error trace [2018-06-22 11:16:13,259 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:13,259 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:13,259 INFO ]: Analyzing trace with hash -1990532750, now seen corresponding path program 8 times [2018-06-22 11:16:13,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:13,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:13,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:13,272 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:13,877 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:13,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:13,877 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:13,885 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:13,937 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:13,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:13,947 INFO ]: Computing forward predicates... [2018-06-22 11:16:14,317 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:16:14,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:14,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2018-06-22 11:16:14,336 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:16:14,336 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:16:14,336 INFO ]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:16:14,336 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 31 states. [2018-06-22 11:16:14,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:14,699 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 11:16:14,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:16:14,699 INFO ]: Start accepts. Automaton has 31 states. Word has length 41 [2018-06-22 11:16:14,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:14,700 INFO ]: With dead ends: 47 [2018-06-22 11:16:14,700 INFO ]: Without dead ends: 47 [2018-06-22 11:16:14,701 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:16:14,701 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:14,703 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-22 11:16:14,703 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:16:14,703 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 11:16:14,703 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 41 [2018-06-22 11:16:14,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:14,704 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 11:16:14,704 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:16:14,704 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 11:16:14,704 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:16:14,704 INFO ]: Found error trace [2018-06-22 11:16:14,704 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:14,704 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:14,705 INFO ]: Analyzing trace with hash -804063293, now seen corresponding path program 7 times [2018-06-22 11:16:14,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:14,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:14,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:14,705 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:14,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:14,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:15,077 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:15,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:15,077 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:15,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:15,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:15,107 INFO ]: Computing forward predicates... [2018-06-22 11:16:16,066 INFO ]: Checked inductivity of 105 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:16:16,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:16,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-06-22 11:16:16,118 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:16:16,118 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:16:16,119 INFO ]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:16:16,119 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 32 states. [2018-06-22 11:16:16,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:16,627 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-22 11:16:16,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:16,627 INFO ]: Start accepts. Automaton has 32 states. Word has length 41 [2018-06-22 11:16:16,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:16,628 INFO ]: With dead ends: 49 [2018-06-22 11:16:16,628 INFO ]: Without dead ends: 49 [2018-06-22 11:16:16,628 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:16:16,628 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:16:16,631 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-06-22 11:16:16,631 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:16:16,631 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 11:16:16,631 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 41 [2018-06-22 11:16:16,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:16,631 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 11:16:16,631 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:16:16,631 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 11:16:16,632 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:16:16,632 INFO ]: Found error trace [2018-06-22 11:16:16,632 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:16,632 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:16,632 INFO ]: Analyzing trace with hash 1777930998, now seen corresponding path program 9 times [2018-06-22 11:16:16,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:16,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:16,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:16,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:16,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:16,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:17,216 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:16:17,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:17,216 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:17,225 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:17,256 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:16:17,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:17,261 INFO ]: Computing forward predicates... [2018-06-22 11:16:17,832 INFO ]: Checked inductivity of 171 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 11:16:17,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:17,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-06-22 11:16:17,851 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:16:17,851 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:16:17,852 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:16:17,852 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 34 states. [2018-06-22 11:16:18,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:18,298 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-22 11:16:18,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:18,299 INFO ]: Start accepts. Automaton has 34 states. Word has length 45 [2018-06-22 11:16:18,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:18,299 INFO ]: With dead ends: 51 [2018-06-22 11:16:18,299 INFO ]: Without dead ends: 51 [2018-06-22 11:16:18,300 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:16:18,300 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:16:18,302 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-06-22 11:16:18,302 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:16:18,303 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 11:16:18,303 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2018-06-22 11:16:18,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:18,303 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 11:16:18,303 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:16:18,303 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 11:16:18,303 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:16:18,303 INFO ]: Found error trace [2018-06-22 11:16:18,303 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:18,304 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:18,304 INFO ]: Analyzing trace with hash -486221561, now seen corresponding path program 8 times [2018-06-22 11:16:18,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:18,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:18,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:18,304 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:18,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:18,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:18,751 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:18,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:18,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:18,756 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:18,780 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:18,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:18,786 INFO ]: Computing forward predicates... [2018-06-22 11:16:19,550 INFO ]: Checked inductivity of 136 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:16:19,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:19,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 35 [2018-06-22 11:16:19,570 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:16:19,570 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:16:19,570 INFO ]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:19,570 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 35 states. [2018-06-22 11:16:20,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:20,496 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-22 11:16:20,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:16:20,496 INFO ]: Start accepts. Automaton has 35 states. Word has length 45 [2018-06-22 11:16:20,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:20,497 INFO ]: With dead ends: 53 [2018-06-22 11:16:20,497 INFO ]: Without dead ends: 53 [2018-06-22 11:16:20,497 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:16:20,497 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:16:20,499 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-22 11:16:20,499 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:16:20,500 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 11:16:20,500 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2018-06-22 11:16:20,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:20,500 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 11:16:20,500 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:16:20,500 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 11:16:20,500 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:16:20,500 INFO ]: Found error trace [2018-06-22 11:16:20,500 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:20,500 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:20,500 INFO ]: Analyzing trace with hash -2070126342, now seen corresponding path program 10 times [2018-06-22 11:16:20,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:20,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:20,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:20,503 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:20,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:20,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:21,517 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:16:21,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:21,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:21,523 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:21,548 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:21,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:21,554 INFO ]: Computing forward predicates... [2018-06-22 11:16:22,044 INFO ]: Checked inductivity of 210 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 11:16:22,064 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:22,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-06-22 11:16:22,064 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:16:22,064 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:16:22,064 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:16:22,065 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 37 states. [2018-06-22 11:16:22,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:22,490 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-22 11:16:22,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:16:22,490 INFO ]: Start accepts. Automaton has 37 states. Word has length 49 [2018-06-22 11:16:22,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:22,491 INFO ]: With dead ends: 55 [2018-06-22 11:16:22,491 INFO ]: Without dead ends: 55 [2018-06-22 11:16:22,492 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=243, Invalid=1919, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:16:22,492 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:16:22,494 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-06-22 11:16:22,494 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:16:22,494 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-22 11:16:22,494 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 49 [2018-06-22 11:16:22,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:22,495 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-22 11:16:22,495 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:16:22,495 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-22 11:16:22,495 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:16:22,495 INFO ]: Found error trace [2018-06-22 11:16:22,495 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:22,495 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:22,496 INFO ]: Analyzing trace with hash -372316469, now seen corresponding path program 9 times [2018-06-22 11:16:22,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:22,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:22,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:22,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:22,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:22,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:23,039 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:16:23,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:23,039 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:23,045 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:23,074 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:16:23,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:23,080 INFO ]: Computing forward predicates... [2018-06-22 11:16:23,365 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 23 Received shutdown request... [2018-06-22 11:16:24,235 INFO ]: Timeout while computing interpolants [2018-06-22 11:16:24,436 WARN ]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:24,436 WARN ]: Verification canceled [2018-06-22 11:16:24,440 WARN ]: Timeout [2018-06-22 11:16:24,440 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:16:24 BoogieIcfgContainer [2018-06-22 11:16:24,440 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:16:24,441 INFO ]: Toolchain (without parser) took 70891.08 ms. Allocated memory was 308.8 MB in the beginning and 637.0 MB in the end (delta: 328.2 MB). Free memory was 261.2 MB in the beginning and 612.5 MB in the end (delta: -351.3 MB). Peak memory consumption was 83.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:24,441 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:16:24,441 INFO ]: ChcToBoogie took 47.68 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 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:16:24,442 INFO ]: Boogie Preprocessor took 43.74 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 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:16:24,442 INFO ]: RCFGBuilder took 390.98 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:24,442 INFO ]: TraceAbstraction took 70397.98 ms. Allocated memory was 308.8 MB in the beginning and 637.0 MB in the end (delta: 328.2 MB). Free memory was 247.2 MB in the beginning and 612.5 MB in the end (delta: -365.3 MB). Peak memory consumption was 69.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:24,449 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 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.68 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.74 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 390.98 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 70397.98 ms. Allocated memory was 308.8 MB in the beginning and 637.0 MB in the end (delta: 328.2 MB). Free memory was 247.2 MB in the beginning and 612.5 MB in the end (delta: -365.3 MB). Peak memory consumption was 69.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. TIMEOUT Result, 70.3s OverallTime, 30 OverallIterations, 11 TraceHistogramMax, 46.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 741 SDtfs, 376 SDslu, 5188 SDs, 0 SdLazy, 3589 SolverSat, 350 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 434 SyntacticMatches, 8 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 38.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 220 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 1208 ConstructedInterpolants, 72 QuantifiedInterpolants, 666624 SizeOfPredicates, 488 NumberOfNonLiveVariables, 2853 ConjunctsInSsa, 1818 ConjunctsInUnsatCore, 47 InterpolantComputations, 11 PerfectInterpolantSequences, 920/2556 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-16-24-466.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-16-24-466.csv Completed graceful shutdown