java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:17:32,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:17:32,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:17:32,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:17:32,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:17:32,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:17:32,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:17:32,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:17:32,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:17:32,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:17:32,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:17:32,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:17:32,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:17:32,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:17:32,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:17:32,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:17:32,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:17:32,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:17:32,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:17:32,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:17:32,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:17:32,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:17:32,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:17:32,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:17:32,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:17:32,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:17:32,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:17:32,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:17:32,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:17:32,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:17:32,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:17:32,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:17:32,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:17:32,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:17:32,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:17:32,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:17:32,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:17:32,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:17:32,259 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:17:32,259 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:17:32,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:17:32,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:17:32,260 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:17:32,260 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:17:32,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:17:32,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:17:32,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:17:32,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:17:32,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:17:32,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:17:32,262 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:17:32,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:17:32,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:17:32,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:17:32,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:17:32,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:17:32,263 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:17:32,265 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:17:32,265 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:17:32,318 INFO ]: Repository-Root is: /tmp [2018-06-25 09:17:32,331 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:17:32,334 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:17:32,336 INFO ]: Initializing SmtParser... [2018-06-25 09:17:32,336 INFO ]: SmtParser initialized [2018-06-25 09:17:32,337 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 [2018-06-25 09:17:32,341 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:17:32,436 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 unknown [2018-06-25 09:17:32,668 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 [2018-06-25 09:17:32,673 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:17:32,680 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:17:32,680 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:17:32,680 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:17:32,680 INFO ]: ChcToBoogie initialized [2018-06-25 09:17:32,683 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,728 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32 Unit [2018-06-25 09:17:32,728 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:17:32,728 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:17:32,728 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:17:32,729 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:17:32,749 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,749 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,755 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,755 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,766 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,768 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,769 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... [2018-06-25 09:17:32,771 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:17:32,771 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:17:32,771 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:17:32,771 INFO ]: RCFGBuilder initialized [2018-06-25 09:17:32,780 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:17:32,794 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:17:32,794 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:17:32,794 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:17:32,794 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:17:32,794 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:17:32,794 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:17:33,148 INFO ]: Using library mode [2018-06-25 09:17:33,149 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:17:33 BoogieIcfgContainer [2018-06-25 09:17:33,149 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:17:33,150 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:17:33,150 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:17:33,153 INFO ]: TraceAbstraction initialized [2018-06-25 09:17:33,153 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:17:32" (1/3) ... [2018-06-25 09:17:33,155 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed88a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:17:33, skipping insertion in model container [2018-06-25 09:17:33,155 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:17:32" (2/3) ... [2018-06-25 09:17:33,155 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed88a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:17:33, skipping insertion in model container [2018-06-25 09:17:33,155 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:17:33" (3/3) ... [2018-06-25 09:17:33,157 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:17:33,165 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:17:33,173 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:17:33,205 INFO ]: Using default assertion order modulation [2018-06-25 09:17:33,206 INFO ]: Interprodecural is true [2018-06-25 09:17:33,206 INFO ]: Hoare is false [2018-06-25 09:17:33,206 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:17:33,206 INFO ]: Backedges is TWOTRACK [2018-06-25 09:17:33,206 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:17:33,208 INFO ]: Difference is false [2018-06-25 09:17:33,208 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:17:33,208 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:17:33,220 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:17:33,229 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:17:33,229 INFO ]: Found error trace [2018-06-25 09:17:33,230 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:33,230 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:33,234 INFO ]: Analyzing trace with hash -838569332, now seen corresponding path program 1 times [2018-06-25 09:17:33,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:33,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:33,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:33,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:33,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:33,311 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:33,511 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-25 09:17:33,513 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:33,515 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:17:33,515 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:17:33,516 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:17:33,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:17:33,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:17:33,528 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-25 09:17:33,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:33,747 INFO ]: Finished difference Result 15 states and 37 transitions. [2018-06-25 09:17:33,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:17:33,749 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:17:33,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:33,764 INFO ]: With dead ends: 15 [2018-06-25 09:17:33,764 INFO ]: Without dead ends: 15 [2018-06-25 09:17:33,772 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:17:33,790 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:17:33,813 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-25 09:17:33,815 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:17:33,815 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-06-25 09:17:33,817 INFO ]: Start accepts. Automaton has 11 states and 29 transitions. Word has length 7 [2018-06-25 09:17:33,819 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:33,819 INFO ]: Abstraction has 11 states and 29 transitions. [2018-06-25 09:17:33,819 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:17:33,819 INFO ]: Start isEmpty. Operand 11 states and 29 transitions. [2018-06-25 09:17:33,819 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:17:33,819 INFO ]: Found error trace [2018-06-25 09:17:33,820 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:33,820 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:33,820 INFO ]: Analyzing trace with hash -243040508, now seen corresponding path program 1 times [2018-06-25 09:17:33,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:33,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:33,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:33,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:33,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:33,835 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:33,905 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:33,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:33,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:33,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:33,957 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:33,965 INFO ]: Computing forward predicates... [2018-06-25 09:17:34,109 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:34,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:34,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:17:34,132 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:17:34,133 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:17:34,133 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:17:34,133 INFO ]: Start difference. First operand 11 states and 29 transitions. Second operand 6 states. [2018-06-25 09:17:34,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:34,525 INFO ]: Finished difference Result 26 states and 63 transitions. [2018-06-25 09:17:34,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:17:34,525 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:17:34,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:34,526 INFO ]: With dead ends: 26 [2018-06-25 09:17:34,526 INFO ]: Without dead ends: 26 [2018-06-25 09:17:34,527 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:17:34,527 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:17:34,530 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-06-25 09:17:34,530 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:17:34,531 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-06-25 09:17:34,531 INFO ]: Start accepts. Automaton has 14 states and 43 transitions. Word has length 8 [2018-06-25 09:17:34,531 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:34,531 INFO ]: Abstraction has 14 states and 43 transitions. [2018-06-25 09:17:34,531 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:17:34,531 INFO ]: Start isEmpty. Operand 14 states and 43 transitions. [2018-06-25 09:17:34,532 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:17:34,532 INFO ]: Found error trace [2018-06-25 09:17:34,532 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:34,532 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:34,532 INFO ]: Analyzing trace with hash -254122760, now seen corresponding path program 1 times [2018-06-25 09:17:34,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:34,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:34,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:34,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:34,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:34,543 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:34,563 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:34,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:17:34,563 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:17:34,563 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:17:34,563 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:17:34,563 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:17:34,563 INFO ]: Start difference. First operand 14 states and 43 transitions. Second operand 3 states. [2018-06-25 09:17:34,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:34,750 INFO ]: Finished difference Result 18 states and 52 transitions. [2018-06-25 09:17:34,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:17:34,751 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:17:34,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:34,752 INFO ]: With dead ends: 18 [2018-06-25 09:17:34,752 INFO ]: Without dead ends: 18 [2018-06-25 09:17:34,752 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:17:34,752 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:17:34,754 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-25 09:17:34,754 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:17:34,755 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2018-06-25 09:17:34,755 INFO ]: Start accepts. Automaton has 15 states and 47 transitions. Word has length 8 [2018-06-25 09:17:34,755 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:34,755 INFO ]: Abstraction has 15 states and 47 transitions. [2018-06-25 09:17:34,755 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:17:34,755 INFO ]: Start isEmpty. Operand 15 states and 47 transitions. [2018-06-25 09:17:34,756 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:17:34,756 INFO ]: Found error trace [2018-06-25 09:17:34,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:34,756 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:34,756 INFO ]: Analyzing trace with hash -239346424, now seen corresponding path program 1 times [2018-06-25 09:17:34,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:34,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:34,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:34,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:34,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:34,769 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:34,975 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:34,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:34,975 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) [2018-06-25 09:17:34,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:35,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:35,016 INFO ]: Computing forward predicates... [2018-06-25 09:17:35,068 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:35,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:35,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:17:35,087 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:17:35,087 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:17:35,087 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:17:35,087 INFO ]: Start difference. First operand 15 states and 47 transitions. Second operand 5 states. [2018-06-25 09:17:35,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:35,485 INFO ]: Finished difference Result 20 states and 61 transitions. [2018-06-25 09:17:35,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:17:35,486 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:17:35,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:35,487 INFO ]: With dead ends: 20 [2018-06-25 09:17:35,487 INFO ]: Without dead ends: 20 [2018-06-25 09:17:35,487 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:17:35,487 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:17:35,489 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-25 09:17:35,489 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:17:35,492 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2018-06-25 09:17:35,492 INFO ]: Start accepts. Automaton has 16 states and 53 transitions. Word has length 8 [2018-06-25 09:17:35,492 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:35,492 INFO ]: Abstraction has 16 states and 53 transitions. [2018-06-25 09:17:35,492 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:17:35,492 INFO ]: Start isEmpty. Operand 16 states and 53 transitions. [2018-06-25 09:17:35,492 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:17:35,492 INFO ]: Found error trace [2018-06-25 09:17:35,493 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:35,493 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:35,493 INFO ]: Analyzing trace with hash 1496550268, now seen corresponding path program 1 times [2018-06-25 09:17:35,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:35,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:35,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:35,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:35,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:35,512 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:35,573 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:35,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:35,573 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:35,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:35,594 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:35,596 INFO ]: Computing forward predicates... [2018-06-25 09:17:35,664 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:35,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:35,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:17:35,686 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:17:35,686 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:17:35,686 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:17:35,686 INFO ]: Start difference. First operand 16 states and 53 transitions. Second operand 8 states. [2018-06-25 09:17:35,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:35,846 INFO ]: Finished difference Result 23 states and 76 transitions. [2018-06-25 09:17:35,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:17:35,848 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:17:35,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:35,848 INFO ]: With dead ends: 23 [2018-06-25 09:17:35,848 INFO ]: Without dead ends: 23 [2018-06-25 09:17:35,849 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:17:35,849 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:17:35,852 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-25 09:17:35,852 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:17:35,853 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2018-06-25 09:17:35,853 INFO ]: Start accepts. Automaton has 17 states and 57 transitions. Word has length 9 [2018-06-25 09:17:35,853 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:35,853 INFO ]: Abstraction has 17 states and 57 transitions. [2018-06-25 09:17:35,853 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:17:35,853 INFO ]: Start isEmpty. Operand 17 states and 57 transitions. [2018-06-25 09:17:35,853 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:17:35,853 INFO ]: Found error trace [2018-06-25 09:17:35,853 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:35,853 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:35,854 INFO ]: Analyzing trace with hash 694934040, now seen corresponding path program 1 times [2018-06-25 09:17:35,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:35,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:35,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:35,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:35,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:35,864 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:35,907 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:35,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:35,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:35,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:35,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:35,932 INFO ]: Computing forward predicates... [2018-06-25 09:17:35,973 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:36,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:36,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-25 09:17:36,002 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:17:36,002 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:17:36,002 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:17:36,002 INFO ]: Start difference. First operand 17 states and 57 transitions. Second operand 7 states. [2018-06-25 09:17:36,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:36,121 INFO ]: Finished difference Result 19 states and 58 transitions. [2018-06-25 09:17:36,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:17:36,121 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:17:36,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:36,122 INFO ]: With dead ends: 19 [2018-06-25 09:17:36,122 INFO ]: Without dead ends: 19 [2018-06-25 09:17:36,122 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:17:36,122 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:17:36,124 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 09:17:36,124 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:17:36,124 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2018-06-25 09:17:36,124 INFO ]: Start accepts. Automaton has 14 states and 38 transitions. Word has length 9 [2018-06-25 09:17:36,124 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:36,124 INFO ]: Abstraction has 14 states and 38 transitions. [2018-06-25 09:17:36,124 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:17:36,124 INFO ]: Start isEmpty. Operand 14 states and 38 transitions. [2018-06-25 09:17:36,125 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:17:36,125 INFO ]: Found error trace [2018-06-25 09:17:36,125 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:36,125 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:36,125 INFO ]: Analyzing trace with hash 1153000456, now seen corresponding path program 1 times [2018-06-25 09:17:36,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:36,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:36,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:36,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:36,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:36,146 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:36,195 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:36,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:36,195 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:36,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:36,229 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:36,231 INFO ]: Computing forward predicates... [2018-06-25 09:17:36,386 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:36,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:36,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:17:36,405 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:17:36,405 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:17:36,405 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:17:36,405 INFO ]: Start difference. First operand 14 states and 38 transitions. Second operand 8 states. [2018-06-25 09:17:36,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:36,572 INFO ]: Finished difference Result 25 states and 80 transitions. [2018-06-25 09:17:36,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:17:36,573 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:17:36,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:36,574 INFO ]: With dead ends: 25 [2018-06-25 09:17:36,574 INFO ]: Without dead ends: 25 [2018-06-25 09:17:36,574 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:17:36,574 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:17:36,576 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-06-25 09:17:36,576 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:17:36,577 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-06-25 09:17:36,577 INFO ]: Start accepts. Automaton has 14 states and 36 transitions. Word has length 9 [2018-06-25 09:17:36,577 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:36,577 INFO ]: Abstraction has 14 states and 36 transitions. [2018-06-25 09:17:36,577 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:17:36,577 INFO ]: Start isEmpty. Operand 14 states and 36 transitions. [2018-06-25 09:17:36,577 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:17:36,577 INFO ]: Found error trace [2018-06-25 09:17:36,577 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:36,577 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:36,578 INFO ]: Analyzing trace with hash 1156694540, now seen corresponding path program 2 times [2018-06-25 09:17:36,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:36,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:36,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:36,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:36,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:36,596 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:36,650 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:36,650 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:36,650 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:36,656 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:17:36,669 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:17:36,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:36,671 INFO ]: Computing forward predicates... [2018-06-25 09:17:36,723 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:36,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:36,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:17:36,742 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:17:36,742 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:17:36,742 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:17:36,743 INFO ]: Start difference. First operand 14 states and 36 transitions. Second operand 7 states. [2018-06-25 09:17:37,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:37,025 INFO ]: Finished difference Result 26 states and 74 transitions. [2018-06-25 09:17:37,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:17:37,026 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:17:37,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:37,027 INFO ]: With dead ends: 26 [2018-06-25 09:17:37,027 INFO ]: Without dead ends: 26 [2018-06-25 09:17:37,027 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:17:37,027 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:17:37,029 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-06-25 09:17:37,029 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:17:37,030 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-06-25 09:17:37,030 INFO ]: Start accepts. Automaton has 16 states and 48 transitions. Word has length 9 [2018-06-25 09:17:37,030 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:37,030 INFO ]: Abstraction has 16 states and 48 transitions. [2018-06-25 09:17:37,030 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:17:37,030 INFO ]: Start isEmpty. Operand 16 states and 48 transitions. [2018-06-25 09:17:37,030 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:17:37,030 INFO ]: Found error trace [2018-06-25 09:17:37,030 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:37,030 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:37,030 INFO ]: Analyzing trace with hash 50923768, now seen corresponding path program 2 times [2018-06-25 09:17:37,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:37,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:37,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:37,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:37,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:37,042 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:37,086 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:37,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:37,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:37,092 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:17:37,107 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:17:37,107 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:37,108 INFO ]: Computing forward predicates... [2018-06-25 09:17:37,148 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:37,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:37,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-25 09:17:37,167 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:17:37,167 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:17:37,167 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:17:37,167 INFO ]: Start difference. First operand 16 states and 48 transitions. Second operand 9 states. [2018-06-25 09:17:37,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:37,780 INFO ]: Finished difference Result 31 states and 108 transitions. [2018-06-25 09:17:37,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:17:37,781 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 09:17:37,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:37,782 INFO ]: With dead ends: 31 [2018-06-25 09:17:37,782 INFO ]: Without dead ends: 31 [2018-06-25 09:17:37,782 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:17:37,782 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:17:37,784 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-25 09:17:37,784 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:17:37,785 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2018-06-25 09:17:37,785 INFO ]: Start accepts. Automaton has 17 states and 52 transitions. Word has length 10 [2018-06-25 09:17:37,785 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:37,785 INFO ]: Abstraction has 17 states and 52 transitions. [2018-06-25 09:17:37,785 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:17:37,785 INFO ]: Start isEmpty. Operand 17 states and 52 transitions. [2018-06-25 09:17:37,786 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:17:37,786 INFO ]: Found error trace [2018-06-25 09:17:37,786 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:37,786 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:37,786 INFO ]: Analyzing trace with hash 1480597380, now seen corresponding path program 2 times [2018-06-25 09:17:37,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:37,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:37,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:37,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:37,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:37,796 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:37,849 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:37,850 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:37,850 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:37,858 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:17:37,871 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:17:37,871 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:37,872 INFO ]: Computing forward predicates... [2018-06-25 09:17:38,046 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:38,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:38,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-25 09:17:38,066 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:17:38,066 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:17:38,066 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:17:38,066 INFO ]: Start difference. First operand 17 states and 52 transitions. Second operand 10 states. [2018-06-25 09:17:39,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:39,968 INFO ]: Finished difference Result 37 states and 130 transitions. [2018-06-25 09:17:39,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:17:39,969 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 09:17:39,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:39,970 INFO ]: With dead ends: 37 [2018-06-25 09:17:39,970 INFO ]: Without dead ends: 37 [2018-06-25 09:17:39,970 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:17:39,970 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:17:39,973 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 17. [2018-06-25 09:17:39,973 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:17:39,973 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-06-25 09:17:39,973 INFO ]: Start accepts. Automaton has 17 states and 50 transitions. Word has length 10 [2018-06-25 09:17:39,973 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:39,973 INFO ]: Abstraction has 17 states and 50 transitions. [2018-06-25 09:17:39,973 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:17:39,973 INFO ]: Start isEmpty. Operand 17 states and 50 transitions. [2018-06-25 09:17:39,974 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:17:39,974 INFO ]: Found error trace [2018-06-25 09:17:39,974 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:39,974 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:39,974 INFO ]: Analyzing trace with hash 1561441816, now seen corresponding path program 3 times [2018-06-25 09:17:39,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:39,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:39,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:39,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:39,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:39,991 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:40,045 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:40,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:40,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:40,063 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:17:40,090 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:17:40,090 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:40,092 INFO ]: Computing forward predicates... [2018-06-25 09:17:40,187 INFO ]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:40,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:40,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:17:40,207 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:17:40,207 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:17:40,207 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:17:40,208 INFO ]: Start difference. First operand 17 states and 50 transitions. Second operand 12 states. [2018-06-25 09:17:40,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:40,970 INFO ]: Finished difference Result 34 states and 115 transitions. [2018-06-25 09:17:40,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:17:40,970 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:17:40,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:40,971 INFO ]: With dead ends: 34 [2018-06-25 09:17:40,971 INFO ]: Without dead ends: 34 [2018-06-25 09:17:40,972 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:17:40,972 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:17:40,974 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 17. [2018-06-25 09:17:40,974 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:17:40,974 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2018-06-25 09:17:40,974 INFO ]: Start accepts. Automaton has 17 states and 47 transitions. Word has length 11 [2018-06-25 09:17:40,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:40,974 INFO ]: Abstraction has 17 states and 47 transitions. [2018-06-25 09:17:40,974 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:17:40,974 INFO ]: Start isEmpty. Operand 17 states and 47 transitions. [2018-06-25 09:17:40,975 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:17:40,975 INFO ]: Found error trace [2018-06-25 09:17:40,975 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:40,975 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:40,975 INFO ]: Analyzing trace with hash -1248799864, now seen corresponding path program 3 times [2018-06-25 09:17:40,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:40,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:40,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:40,976 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:40,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:40,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:41,159 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:41,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:41,159 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:41,175 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:17:41,201 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:17:41,201 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:41,203 INFO ]: Computing forward predicates... [2018-06-25 09:17:41,370 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:41,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:41,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:17:41,393 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:17:41,393 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:17:41,393 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:17:41,393 INFO ]: Start difference. First operand 17 states and 47 transitions. Second operand 12 states. [2018-06-25 09:17:41,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:41,675 INFO ]: Finished difference Result 38 states and 131 transitions. [2018-06-25 09:17:41,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:17:41,676 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:17:41,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:41,676 INFO ]: With dead ends: 38 [2018-06-25 09:17:41,676 INFO ]: Without dead ends: 38 [2018-06-25 09:17:41,677 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:17:41,677 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:17:41,680 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 18. [2018-06-25 09:17:41,680 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:17:41,681 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-06-25 09:17:41,681 INFO ]: Start accepts. Automaton has 18 states and 51 transitions. Word has length 11 [2018-06-25 09:17:41,681 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:41,681 INFO ]: Abstraction has 18 states and 51 transitions. [2018-06-25 09:17:41,681 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:17:41,681 INFO ]: Start isEmpty. Operand 18 states and 51 transitions. [2018-06-25 09:17:41,681 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:17:41,681 INFO ]: Found error trace [2018-06-25 09:17:41,681 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:41,681 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:41,681 INFO ]: Analyzing trace with hash -1245105780, now seen corresponding path program 3 times [2018-06-25 09:17:41,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:41,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:41,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:41,682 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:41,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:41,695 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:41,803 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:41,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:41,804 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:41,809 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:17:41,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:17:41,835 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:41,837 INFO ]: Computing forward predicates... [2018-06-25 09:17:41,958 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:41,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:41,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 09:17:41,976 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:17:41,976 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:17:41,977 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:17:41,977 INFO ]: Start difference. First operand 18 states and 51 transitions. Second operand 11 states. [2018-06-25 09:17:44,612 WARN ]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-25 09:17:45,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:45,128 INFO ]: Finished difference Result 26 states and 83 transitions. [2018-06-25 09:17:45,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:17:45,187 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-25 09:17:45,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:45,188 INFO ]: With dead ends: 26 [2018-06-25 09:17:45,188 INFO ]: Without dead ends: 26 [2018-06-25 09:17:45,188 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:17:45,188 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:17:45,190 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-25 09:17:45,190 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:17:45,190 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-06-25 09:17:45,190 INFO ]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 11 [2018-06-25 09:17:45,190 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:45,190 INFO ]: Abstraction has 20 states and 59 transitions. [2018-06-25 09:17:45,190 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:17:45,190 INFO ]: Start isEmpty. Operand 20 states and 59 transitions. [2018-06-25 09:17:45,191 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:17:45,191 INFO ]: Found error trace [2018-06-25 09:17:45,191 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:45,191 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:45,191 INFO ]: Analyzing trace with hash -475832204, now seen corresponding path program 1 times [2018-06-25 09:17:45,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:45,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:45,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:45,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:45,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:45,207 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:45,326 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:45,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:45,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:17:45,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:45,368 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:45,370 INFO ]: Computing forward predicates... [2018-06-25 09:17:45,683 INFO ]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:17:45,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:45,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-25 09:17:45,701 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:17:45,702 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:17:45,702 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:17:45,702 INFO ]: Start difference. First operand 20 states and 59 transitions. Second operand 11 states. [2018-06-25 09:17:46,198 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-25 09:17:46,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:46,828 INFO ]: Finished difference Result 54 states and 164 transitions. [2018-06-25 09:17:46,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:17:46,829 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 09:17:46,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:46,829 INFO ]: With dead ends: 54 [2018-06-25 09:17:46,829 INFO ]: Without dead ends: 54 [2018-06-25 09:17:46,830 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:17:46,830 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:17:46,834 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-25 09:17:46,834 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:17:46,834 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 107 transitions. [2018-06-25 09:17:46,835 INFO ]: Start accepts. Automaton has 35 states and 107 transitions. Word has length 12 [2018-06-25 09:17:46,835 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:46,835 INFO ]: Abstraction has 35 states and 107 transitions. [2018-06-25 09:17:46,835 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:17:46,835 INFO ]: Start isEmpty. Operand 35 states and 107 transitions. [2018-06-25 09:17:46,835 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:17:46,835 INFO ]: Found error trace [2018-06-25 09:17:46,835 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:46,835 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:46,835 INFO ]: Analyzing trace with hash -71591028, now seen corresponding path program 4 times [2018-06-25 09:17:46,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:46,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:46,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:46,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:17:46,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:46,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:46,950 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:46,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:46,951 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-25 09:17:46,957 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:17:46,995 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:17:46,995 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:46,996 INFO ]: Computing forward predicates... [2018-06-25 09:17:47,144 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:47,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:47,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:17:47,163 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:17:47,163 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:17:47,163 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:17:47,164 INFO ]: Start difference. First operand 35 states and 107 transitions. Second operand 14 states. [2018-06-25 09:17:47,832 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2018-06-25 09:17:48,393 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2018-06-25 09:17:48,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:48,599 INFO ]: Finished difference Result 79 states and 265 transitions. [2018-06-25 09:17:48,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:17:48,600 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-25 09:17:48,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:48,601 INFO ]: With dead ends: 79 [2018-06-25 09:17:48,601 INFO ]: Without dead ends: 79 [2018-06-25 09:17:48,601 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:17:48,601 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 09:17:48,609 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 35. [2018-06-25 09:17:48,609 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:17:48,609 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 107 transitions. [2018-06-25 09:17:48,609 INFO ]: Start accepts. Automaton has 35 states and 107 transitions. Word has length 12 [2018-06-25 09:17:48,609 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:48,609 INFO ]: Abstraction has 35 states and 107 transitions. [2018-06-25 09:17:48,609 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:17:48,609 INFO ]: Start isEmpty. Operand 35 states and 107 transitions. [2018-06-25 09:17:48,610 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:17:48,610 INFO ]: Found error trace [2018-06-25 09:17:48,610 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:48,610 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:48,610 INFO ]: Analyzing trace with hash 39231492, now seen corresponding path program 5 times [2018-06-25 09:17:48,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:48,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:48,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:48,611 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:48,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:48,627 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:48,688 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:48,688 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:48,688 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-25 09:17:48,695 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:17:48,712 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:17:48,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:48,713 INFO ]: Computing forward predicates... [2018-06-25 09:17:48,755 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:48,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:48,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:17:48,773 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:17:48,774 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:17:48,774 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:17:48,774 INFO ]: Start difference. First operand 35 states and 107 transitions. Second operand 8 states. [2018-06-25 09:17:48,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:48,916 INFO ]: Finished difference Result 84 states and 273 transitions. [2018-06-25 09:17:48,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:17:48,917 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-25 09:17:48,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:48,917 INFO ]: With dead ends: 84 [2018-06-25 09:17:48,917 INFO ]: Without dead ends: 84 [2018-06-25 09:17:48,918 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:17:48,918 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 09:17:48,921 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 35. [2018-06-25 09:17:48,921 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:17:48,922 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 107 transitions. [2018-06-25 09:17:48,922 INFO ]: Start accepts. Automaton has 35 states and 107 transitions. Word has length 12 [2018-06-25 09:17:48,922 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:48,922 INFO ]: Abstraction has 35 states and 107 transitions. [2018-06-25 09:17:48,922 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:17:48,922 INFO ]: Start isEmpty. Operand 35 states and 107 transitions. [2018-06-25 09:17:48,923 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:17:48,923 INFO ]: Found error trace [2018-06-25 09:17:48,923 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:48,923 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:48,923 INFO ]: Analyzing trace with hash 1670617380, now seen corresponding path program 2 times [2018-06-25 09:17:48,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:48,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:48,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:48,924 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:48,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:48,935 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:49,080 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:49,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:49,080 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-25 09:17:49,085 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:17:49,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:17:49,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:49,120 INFO ]: Computing forward predicates... [2018-06-25 09:17:49,571 INFO ]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:17:49,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:49,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-25 09:17:49,603 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:17:49,603 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:17:49,603 INFO ]: CoverageRelationStatistics Valid=30, Invalid=151, Unknown=1, NotChecked=0, Total=182 [2018-06-25 09:17:49,603 INFO ]: Start difference. First operand 35 states and 107 transitions. Second operand 14 states. [2018-06-25 09:17:50,668 WARN ]: Spent 329.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-06-25 09:17:50,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:50,930 INFO ]: Finished difference Result 169 states and 529 transitions. [2018-06-25 09:17:50,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:17:50,931 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-25 09:17:50,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:50,932 INFO ]: With dead ends: 169 [2018-06-25 09:17:50,932 INFO ]: Without dead ends: 169 [2018-06-25 09:17:50,933 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=1029, Unknown=1, NotChecked=0, Total=1260 [2018-06-25 09:17:50,933 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-25 09:17:50,940 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 85. [2018-06-25 09:17:50,940 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 09:17:50,941 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 271 transitions. [2018-06-25 09:17:50,941 INFO ]: Start accepts. Automaton has 85 states and 271 transitions. Word has length 13 [2018-06-25 09:17:50,942 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:50,942 INFO ]: Abstraction has 85 states and 271 transitions. [2018-06-25 09:17:50,942 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:17:50,942 INFO ]: Start isEmpty. Operand 85 states and 271 transitions. [2018-06-25 09:17:50,943 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:17:50,943 INFO ]: Found error trace [2018-06-25 09:17:50,943 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:50,943 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:50,943 INFO ]: Analyzing trace with hash 1785133984, now seen corresponding path program 3 times [2018-06-25 09:17:50,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:50,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:50,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:50,943 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:50,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:50,954 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:51,352 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:51,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:17:51,352 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-25 09:17:51,359 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:17:51,381 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:17:51,381 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:17:51,383 INFO ]: Computing forward predicates... [2018-06-25 09:17:51,481 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:17:51,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:17:51,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:17:51,502 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:17:51,502 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:17:51,502 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:17:51,502 INFO ]: Start difference. First operand 85 states and 271 transitions. Second operand 16 states. [2018-06-25 09:17:51,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:17:51,813 INFO ]: Finished difference Result 160 states and 527 transitions. [2018-06-25 09:17:51,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:17:51,815 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-25 09:17:51,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:17:51,816 INFO ]: With dead ends: 160 [2018-06-25 09:17:51,816 INFO ]: Without dead ends: 160 [2018-06-25 09:17:51,816 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:17:51,816 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-25 09:17:51,822 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 86. [2018-06-25 09:17:51,822 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-25 09:17:51,824 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 275 transitions. [2018-06-25 09:17:51,824 INFO ]: Start accepts. Automaton has 86 states and 275 transitions. Word has length 13 [2018-06-25 09:17:51,824 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:17:51,825 INFO ]: Abstraction has 86 states and 275 transitions. [2018-06-25 09:17:51,825 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:17:51,825 INFO ]: Start isEmpty. Operand 86 states and 275 transitions. [2018-06-25 09:17:51,825 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:17:51,826 INFO ]: Found error trace [2018-06-25 09:17:51,826 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:17:51,826 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:17:51,826 INFO ]: Analyzing trace with hash 911393304, now seen corresponding path program 4 times [2018-06-25 09:17:51,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:17:51,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:17:51,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:51,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:17:51,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:17:51,837 INFO ]: Conjunction of SSA is sat [2018-06-25 09:17:51,839 INFO ]: Counterexample might be feasible [2018-06-25 09:17:51,863 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:17:51 BoogieIcfgContainer [2018-06-25 09:17:51,863 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:17:51,864 INFO ]: Toolchain (without parser) took 19190.73 ms. Allocated memory was 302.0 MB in the beginning and 427.3 MB in the end (delta: 125.3 MB). Free memory was 257.1 MB in the beginning and 396.3 MB in the end (delta: -139.3 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:17:51,865 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:17:51,865 INFO ]: ChcToBoogie took 47.91 ms. Allocated memory is still 302.0 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:17:51,866 INFO ]: Boogie Preprocessor took 42.14 ms. Allocated memory is still 302.0 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:17:51,866 INFO ]: RCFGBuilder took 377.84 ms. Allocated memory is still 302.0 MB. Free memory was 253.1 MB in the beginning and 242.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:17:51,866 INFO ]: TraceAbstraction took 18713.03 ms. Allocated memory was 302.0 MB in the beginning and 427.3 MB in the end (delta: 125.3 MB). Free memory was 241.4 MB in the beginning and 396.3 MB in the end (delta: -154.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:17:51,869 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.91 ms. Allocated memory is still 302.0 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.14 ms. Allocated memory is still 302.0 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 377.84 ms. Allocated memory is still 302.0 MB. Free memory was 253.1 MB in the beginning and 242.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18713.03 ms. Allocated memory was 302.0 MB in the beginning and 427.3 MB in the end (delta: 125.3 MB). Free memory was 241.4 MB in the beginning and 396.3 MB in the end (delta: -154.9 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (-1 * hbv_False_3_Int == 0 && !(hbv_False_4_Int == hbv_False_5_Int)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] havoc hbv_False_2_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -32 == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((((((hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -31 == hbv_REC_f_f_3_Int) && hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int; [L0] assume ((hhv_REC_f_f_4_Int == hhv_REC_f_f_3_Int && hhv_REC_f_f_2_Int <= 0) && hhv_REC_f_f_0_Int <= 0) && -1 * hhv_REC_f_f_1_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 18.6s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 236 SDtfs, 127 SDslu, 980 SDs, 0 SdLazy, 1716 SolverSat, 960 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=18, 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, 18 MinimizatonAttempts, 402 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 315 ConstructedInterpolants, 21 QuantifiedInterpolants, 14824 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1882 ConjunctsInSsa, 412 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 36/287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-17-51-891.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-17-51-891.csv Received shutdown request...