java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:21:30,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:21:30,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:21:30,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:21:30,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:21:30,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:21:30,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:21:30,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:21:30,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:21:30,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:21:30,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:21:30,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:21:30,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:21:30,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:21:30,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:21:30,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:21:30,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:21:30,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:21:30,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:21:30,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:21:30,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:21:30,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:21:30,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:21:30,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:21:30,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:21:30,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:21:30,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:21:30,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:21:30,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:21:30,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:21:30,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:21:30,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:21:30,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:21:30,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:21:30,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:21:30,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:21:30,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:21:30,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:21:30,099 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:21:30,099 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:21:30,100 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:21:30,100 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:21:30,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:21:30,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:21:30,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:21:30,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:21:30,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:21:30,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:21:30,102 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:21:30,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:21:30,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:21:30,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:21:30,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:21:30,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:21:30,103 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:21:30,105 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:21:30,105 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:21:30,154 INFO ]: Repository-Root is: /tmp [2018-06-22 11:21:30,170 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:21:30,175 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:21:30,176 INFO ]: Initializing SmtParser... [2018-06-22 11:21:30,176 INFO ]: SmtParser initialized [2018-06-22 11:21:30,177 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-22 11:21:30,179 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:21:30,274 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 unknown [2018-06-22 11:21:30,508 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-22 11:21:30,520 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:21:30,525 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:21:30,526 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:21:30,526 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:21:30,526 INFO ]: ChcToBoogie initialized [2018-06-22 11:21:30,529 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,586 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30 Unit [2018-06-22 11:21:30,586 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:21:30,587 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:21:30,587 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:21:30,587 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:21:30,605 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,605 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,614 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,614 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,630 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,633 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,635 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... [2018-06-22 11:21:30,647 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:21:30,647 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:21:30,647 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:21:30,647 INFO ]: RCFGBuilder initialized [2018-06-22 11:21:30,648 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:21:30,663 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:21:30,664 INFO ]: Found specification of procedure False [2018-06-22 11:21:30,664 INFO ]: Found implementation of procedure False [2018-06-22 11:21:30,664 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:21:30,664 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:21:30,664 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:21:30,664 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:21:30,664 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:21:30,664 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:21:30,664 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:21:30,664 INFO ]: Found specification of procedure REC__f [2018-06-22 11:21:30,664 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:21:30,664 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:21:30,664 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:21:30,664 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:21:31,292 INFO ]: Using library mode [2018-06-22 11:21:31,293 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:21:31 BoogieIcfgContainer [2018-06-22 11:21:31,293 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:21:31,295 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:21:31,295 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:21:31,298 INFO ]: TraceAbstraction initialized [2018-06-22 11:21:31,298 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:21:30" (1/3) ... [2018-06-22 11:21:31,299 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620ae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:21:31, skipping insertion in model container [2018-06-22 11:21:31,299 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:21:30" (2/3) ... [2018-06-22 11:21:31,299 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620ae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:21:31, skipping insertion in model container [2018-06-22 11:21:31,300 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:21:31" (3/3) ... [2018-06-22 11:21:31,301 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:21:31,310 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:21:31,321 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:21:31,362 INFO ]: Using default assertion order modulation [2018-06-22 11:21:31,363 INFO ]: Interprodecural is true [2018-06-22 11:21:31,363 INFO ]: Hoare is false [2018-06-22 11:21:31,363 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:21:31,363 INFO ]: Backedges is TWOTRACK [2018-06-22 11:21:31,363 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:21:31,363 INFO ]: Difference is false [2018-06-22 11:21:31,363 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:21:31,363 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:21:31,377 INFO ]: Start isEmpty. Operand 39 states. [2018-06-22 11:21:31,406 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:21:31,406 INFO ]: Found error trace [2018-06-22 11:21:31,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:31,407 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:31,411 INFO ]: Analyzing trace with hash -692693388, now seen corresponding path program 1 times [2018-06-22 11:21:31,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:31,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:31,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:31,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:31,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:31,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:31,801 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-22 11:21:31,804 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:21:31,806 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:31,806 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:31,807 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:31,817 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:31,818 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:31,820 INFO ]: Start difference. First operand 39 states. Second operand 4 states. [2018-06-22 11:21:32,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:32,400 INFO ]: Finished difference Result 39 states and 86 transitions. [2018-06-22 11:21:32,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:32,401 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:21:32,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:32,412 INFO ]: With dead ends: 39 [2018-06-22 11:21:32,413 INFO ]: Without dead ends: 39 [2018-06-22 11:21:32,414 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:32,427 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:21:32,459 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 11:21:32,461 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:21:32,463 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2018-06-22 11:21:32,464 INFO ]: Start accepts. Automaton has 39 states and 86 transitions. Word has length 9 [2018-06-22 11:21:32,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:32,465 INFO ]: Abstraction has 39 states and 86 transitions. [2018-06-22 11:21:32,465 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:32,465 INFO ]: Start isEmpty. Operand 39 states and 86 transitions. [2018-06-22 11:21:32,470 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:21:32,470 INFO ]: Found error trace [2018-06-22 11:21:32,470 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:32,470 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:32,470 INFO ]: Analyzing trace with hash -1272860175, now seen corresponding path program 1 times [2018-06-22 11:21:32,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:32,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:32,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:32,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:32,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:32,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:32,620 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:32,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:32,620 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) [2018-06-22 11:21:32,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:32,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:32,681 INFO ]: Computing forward predicates... [2018-06-22 11:21:32,728 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:32,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:32,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:21:32,765 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:21:32,765 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:21:32,765 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:21:32,765 INFO ]: Start difference. First operand 39 states and 86 transitions. Second operand 6 states. [2018-06-22 11:21:33,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:33,730 INFO ]: Finished difference Result 47 states and 128 transitions. [2018-06-22 11:21:33,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:21:33,731 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:21:33,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:33,734 INFO ]: With dead ends: 47 [2018-06-22 11:21:33,734 INFO ]: Without dead ends: 47 [2018-06-22 11:21:33,735 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:21:33,735 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:21:33,753 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:21:33,753 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:21:33,755 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 107 transitions. [2018-06-22 11:21:33,755 INFO ]: Start accepts. Automaton has 43 states and 107 transitions. Word has length 13 [2018-06-22 11:21:33,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:33,756 INFO ]: Abstraction has 43 states and 107 transitions. [2018-06-22 11:21:33,756 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:21:33,756 INFO ]: Start isEmpty. Operand 43 states and 107 transitions. [2018-06-22 11:21:33,759 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:21:33,759 INFO ]: Found error trace [2018-06-22 11:21:33,759 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:33,759 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:33,759 INFO ]: Analyzing trace with hash 198644943, now seen corresponding path program 1 times [2018-06-22 11:21:33,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:33,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:33,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:33,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:33,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:33,768 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:33,840 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:33,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:33,841 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:33,841 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:33,841 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:33,841 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:33,841 INFO ]: Start difference. First operand 43 states and 107 transitions. Second operand 4 states. [2018-06-22 11:21:33,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:33,939 INFO ]: Finished difference Result 47 states and 127 transitions. [2018-06-22 11:21:33,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:33,942 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:21:33,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:33,944 INFO ]: With dead ends: 47 [2018-06-22 11:21:33,944 INFO ]: Without dead ends: 47 [2018-06-22 11:21:33,945 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:33,945 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:21:33,967 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:21:33,967 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:21:33,970 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 107 transitions. [2018-06-22 11:21:33,970 INFO ]: Start accepts. Automaton has 43 states and 107 transitions. Word has length 13 [2018-06-22 11:21:33,970 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:33,970 INFO ]: Abstraction has 43 states and 107 transitions. [2018-06-22 11:21:33,970 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:33,970 INFO ]: Start isEmpty. Operand 43 states and 107 transitions. [2018-06-22 11:21:33,978 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:21:33,978 INFO ]: Found error trace [2018-06-22 11:21:33,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:33,978 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:33,978 INFO ]: Analyzing trace with hash 950314363, now seen corresponding path program 1 times [2018-06-22 11:21:33,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:33,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:33,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:33,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:33,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:33,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:34,169 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:21:34,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:34,169 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:34,169 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:34,169 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:34,169 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:34,169 INFO ]: Start difference. First operand 43 states and 107 transitions. Second operand 4 states. [2018-06-22 11:21:34,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:34,454 INFO ]: Finished difference Result 47 states and 126 transitions. [2018-06-22 11:21:34,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:34,456 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:21:34,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:34,458 INFO ]: With dead ends: 47 [2018-06-22 11:21:34,458 INFO ]: Without dead ends: 47 [2018-06-22 11:21:34,458 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:34,458 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:21:34,468 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-06-22 11:21:34,468 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:21:34,470 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2018-06-22 11:21:34,470 INFO ]: Start accepts. Automaton has 41 states and 96 transitions. Word has length 13 [2018-06-22 11:21:34,470 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:34,470 INFO ]: Abstraction has 41 states and 96 transitions. [2018-06-22 11:21:34,470 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:34,470 INFO ]: Start isEmpty. Operand 41 states and 96 transitions. [2018-06-22 11:21:34,472 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:21:34,472 INFO ]: Found error trace [2018-06-22 11:21:34,472 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:34,472 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:34,473 INFO ]: Analyzing trace with hash -537107616, now seen corresponding path program 1 times [2018-06-22 11:21:34,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:34,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:34,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:34,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:34,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:34,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:34,600 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:34,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:34,600 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:34,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:34,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:34,628 INFO ]: Computing forward predicates... [2018-06-22 11:21:34,735 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:34,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:34,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:21:34,755 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:21:34,756 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:21:34,756 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:21:34,756 INFO ]: Start difference. First operand 41 states and 96 transitions. Second operand 8 states. [2018-06-22 11:21:35,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:35,264 INFO ]: Finished difference Result 59 states and 188 transitions. [2018-06-22 11:21:35,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:21:35,265 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:21:35,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:35,267 INFO ]: With dead ends: 59 [2018-06-22 11:21:35,267 INFO ]: Without dead ends: 59 [2018-06-22 11:21:35,268 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:35,268 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:21:35,281 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-06-22 11:21:35,282 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:21:35,283 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 106 transitions. [2018-06-22 11:21:35,283 INFO ]: Start accepts. Automaton has 43 states and 106 transitions. Word has length 13 [2018-06-22 11:21:35,283 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:35,283 INFO ]: Abstraction has 43 states and 106 transitions. [2018-06-22 11:21:35,283 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:21:35,283 INFO ]: Start isEmpty. Operand 43 states and 106 transitions. [2018-06-22 11:21:35,285 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:21:35,285 INFO ]: Found error trace [2018-06-22 11:21:35,285 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:35,285 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:35,285 INFO ]: Analyzing trace with hash 443895796, now seen corresponding path program 1 times [2018-06-22 11:21:35,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:35,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:35,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:35,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:35,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:35,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:35,454 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:35,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:35,454 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:35,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:35,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:35,469 INFO ]: Computing forward predicates... [2018-06-22 11:21:35,518 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:35,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:35,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:21:35,537 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:21:35,537 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:21:35,537 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:21:35,538 INFO ]: Start difference. First operand 43 states and 106 transitions. Second operand 9 states. [2018-06-22 11:21:36,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:36,143 INFO ]: Finished difference Result 57 states and 177 transitions. [2018-06-22 11:21:36,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:21:36,144 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:21:36,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:36,145 INFO ]: With dead ends: 57 [2018-06-22 11:21:36,145 INFO ]: Without dead ends: 57 [2018-06-22 11:21:36,146 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:21:36,146 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:21:36,158 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 45. [2018-06-22 11:21:36,158 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:21:36,159 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 116 transitions. [2018-06-22 11:21:36,159 INFO ]: Start accepts. Automaton has 45 states and 116 transitions. Word has length 13 [2018-06-22 11:21:36,159 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:36,159 INFO ]: Abstraction has 45 states and 116 transitions. [2018-06-22 11:21:36,159 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:21:36,159 INFO ]: Start isEmpty. Operand 45 states and 116 transitions. [2018-06-22 11:21:36,161 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:36,161 INFO ]: Found error trace [2018-06-22 11:21:36,161 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:36,161 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:36,161 INFO ]: Analyzing trace with hash 1503218222, now seen corresponding path program 2 times [2018-06-22 11:21:36,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:36,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:36,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:36,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:36,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:36,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:36,238 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:36,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:36,239 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) [2018-06-22 11:21:36,253 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:36,274 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:36,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:36,276 INFO ]: Computing forward predicates... [2018-06-22 11:21:36,408 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:36,428 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:36,428 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:21:36,429 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:21:36,429 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:21:36,429 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:36,429 INFO ]: Start difference. First operand 45 states and 116 transitions. Second operand 10 states. [2018-06-22 11:21:36,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:36,930 INFO ]: Finished difference Result 53 states and 157 transitions. [2018-06-22 11:21:36,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:21:36,930 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:21:36,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:36,932 INFO ]: With dead ends: 53 [2018-06-22 11:21:36,932 INFO ]: Without dead ends: 53 [2018-06-22 11:21:36,932 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:21:36,932 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:21:36,941 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:21:36,941 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:21:36,943 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 136 transitions. [2018-06-22 11:21:36,943 INFO ]: Start accepts. Automaton has 49 states and 136 transitions. Word has length 17 [2018-06-22 11:21:36,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:36,943 INFO ]: Abstraction has 49 states and 136 transitions. [2018-06-22 11:21:36,943 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:21:36,943 INFO ]: Start isEmpty. Operand 49 states and 136 transitions. [2018-06-22 11:21:36,945 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:36,945 INFO ]: Found error trace [2018-06-22 11:21:36,945 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:36,945 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:36,945 INFO ]: Analyzing trace with hash 2085306141, now seen corresponding path program 1 times [2018-06-22 11:21:36,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:36,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:36,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:36,946 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:36,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:36,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:37,010 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:37,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:37,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:37,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:37,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:37,040 INFO ]: Computing forward predicates... [2018-06-22 11:21:37,084 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:37,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:37,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:21:37,116 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:21:37,116 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:21:37,116 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:37,116 INFO ]: Start difference. First operand 49 states and 136 transitions. Second operand 10 states. [2018-06-22 11:21:37,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:37,605 INFO ]: Finished difference Result 57 states and 177 transitions. [2018-06-22 11:21:37,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:21:37,605 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:21:37,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:37,606 INFO ]: With dead ends: 57 [2018-06-22 11:21:37,606 INFO ]: Without dead ends: 57 [2018-06-22 11:21:37,606 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:21:37,607 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:21:37,616 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-06-22 11:21:37,616 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:21:37,618 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 136 transitions. [2018-06-22 11:21:37,618 INFO ]: Start accepts. Automaton has 49 states and 136 transitions. Word has length 17 [2018-06-22 11:21:37,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:37,618 INFO ]: Abstraction has 49 states and 136 transitions. [2018-06-22 11:21:37,618 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:21:37,618 INFO ]: Start isEmpty. Operand 49 states and 136 transitions. [2018-06-22 11:21:37,620 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:37,620 INFO ]: Found error trace [2018-06-22 11:21:37,620 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:37,620 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:37,620 INFO ]: Analyzing trace with hash -1793021681, now seen corresponding path program 1 times [2018-06-22 11:21:37,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:37,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:37,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:37,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:37,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:37,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:37,765 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:21:37,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:37,765 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:37,765 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:37,765 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:37,765 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:37,766 INFO ]: Start difference. First operand 49 states and 136 transitions. Second operand 4 states. [2018-06-22 11:21:38,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:38,017 INFO ]: Finished difference Result 51 states and 144 transitions. [2018-06-22 11:21:38,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:38,018 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:21:38,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:38,019 INFO ]: With dead ends: 51 [2018-06-22 11:21:38,019 INFO ]: Without dead ends: 51 [2018-06-22 11:21:38,019 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,019 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:21:38,027 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 11:21:38,027 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:21:38,028 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2018-06-22 11:21:38,028 INFO ]: Start accepts. Automaton has 49 states and 134 transitions. Word has length 17 [2018-06-22 11:21:38,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:38,028 INFO ]: Abstraction has 49 states and 134 transitions. [2018-06-22 11:21:38,028 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:38,028 INFO ]: Start isEmpty. Operand 49 states and 134 transitions. [2018-06-22 11:21:38,030 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:38,030 INFO ]: Found error trace [2018-06-22 11:21:38,030 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:38,030 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:38,030 INFO ]: Analyzing trace with hash -508353770, now seen corresponding path program 1 times [2018-06-22 11:21:38,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:38,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:38,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:38,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:38,122 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:21:38,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:38,122 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:38,122 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:38,122 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:38,122 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,123 INFO ]: Start difference. First operand 49 states and 134 transitions. Second operand 4 states. [2018-06-22 11:21:38,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:38,190 INFO ]: Finished difference Result 57 states and 169 transitions. [2018-06-22 11:21:38,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:38,191 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:21:38,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:38,192 INFO ]: With dead ends: 57 [2018-06-22 11:21:38,192 INFO ]: Without dead ends: 57 [2018-06-22 11:21:38,192 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,193 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:21:38,201 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-06-22 11:21:38,201 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:21:38,202 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 128 transitions. [2018-06-22 11:21:38,202 INFO ]: Start accepts. Automaton has 49 states and 128 transitions. Word has length 17 [2018-06-22 11:21:38,202 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:38,202 INFO ]: Abstraction has 49 states and 128 transitions. [2018-06-22 11:21:38,202 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:38,202 INFO ]: Start isEmpty. Operand 49 states and 128 transitions. [2018-06-22 11:21:38,204 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:38,204 INFO ]: Found error trace [2018-06-22 11:21:38,204 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:38,204 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:38,204 INFO ]: Analyzing trace with hash -337676249, now seen corresponding path program 1 times [2018-06-22 11:21:38,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:38,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:38,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:38,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:38,286 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:38,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:38,286 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:38,286 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:38,286 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:38,286 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,286 INFO ]: Start difference. First operand 49 states and 128 transitions. Second operand 4 states. [2018-06-22 11:21:38,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:38,355 INFO ]: Finished difference Result 53 states and 144 transitions. [2018-06-22 11:21:38,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:38,355 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:21:38,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:38,357 INFO ]: With dead ends: 53 [2018-06-22 11:21:38,357 INFO ]: Without dead ends: 53 [2018-06-22 11:21:38,357 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,357 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:21:38,364 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-06-22 11:21:38,364 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:21:38,365 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 134 transitions. [2018-06-22 11:21:38,365 INFO ]: Start accepts. Automaton has 51 states and 134 transitions. Word has length 17 [2018-06-22 11:21:38,366 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:38,366 INFO ]: Abstraction has 51 states and 134 transitions. [2018-06-22 11:21:38,366 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:38,366 INFO ]: Start isEmpty. Operand 51 states and 134 transitions. [2018-06-22 11:21:38,368 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:38,368 INFO ]: Found error trace [2018-06-22 11:21:38,368 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:38,368 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:38,368 INFO ]: Analyzing trace with hash -893523387, now seen corresponding path program 1 times [2018-06-22 11:21:38,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:38,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:38,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:38,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:38,443 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:38,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:38,443 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:38,444 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:38,444 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:38,444 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,444 INFO ]: Start difference. First operand 51 states and 134 transitions. Second operand 4 states. [2018-06-22 11:21:38,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:38,568 INFO ]: Finished difference Result 61 states and 184 transitions. [2018-06-22 11:21:38,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:21:38,568 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:21:38,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:38,570 INFO ]: With dead ends: 61 [2018-06-22 11:21:38,570 INFO ]: Without dead ends: 61 [2018-06-22 11:21:38,570 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:38,570 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:21:38,578 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-22 11:21:38,578 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:21:38,579 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 133 transitions. [2018-06-22 11:21:38,579 INFO ]: Start accepts. Automaton has 51 states and 133 transitions. Word has length 17 [2018-06-22 11:21:38,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:38,579 INFO ]: Abstraction has 51 states and 133 transitions. [2018-06-22 11:21:38,579 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:38,579 INFO ]: Start isEmpty. Operand 51 states and 133 transitions. [2018-06-22 11:21:38,581 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:38,581 INFO ]: Found error trace [2018-06-22 11:21:38,581 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:38,581 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:38,581 INFO ]: Analyzing trace with hash 473911500, now seen corresponding path program 2 times [2018-06-22 11:21:38,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:38,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:38,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:38,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:38,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:38,747 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:38,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:38,747 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:38,753 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:21:38,764 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:38,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:38,766 INFO ]: Computing forward predicates... [2018-06-22 11:21:38,889 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:38,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:38,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:21:38,909 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:21:38,909 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:21:38,909 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:38,910 INFO ]: Start difference. First operand 51 states and 133 transitions. Second operand 12 states. [2018-06-22 11:21:39,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:39,520 INFO ]: Finished difference Result 65 states and 204 transitions. [2018-06-22 11:21:39,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:21:39,520 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:21:39,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:39,521 INFO ]: With dead ends: 65 [2018-06-22 11:21:39,521 INFO ]: Without dead ends: 65 [2018-06-22 11:21:39,521 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:21:39,522 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:21:39,533 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-06-22 11:21:39,533 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:21:39,534 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 153 transitions. [2018-06-22 11:21:39,534 INFO ]: Start accepts. Automaton has 55 states and 153 transitions. Word has length 17 [2018-06-22 11:21:39,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:39,534 INFO ]: Abstraction has 55 states and 153 transitions. [2018-06-22 11:21:39,534 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:21:39,534 INFO ]: Start isEmpty. Operand 55 states and 153 transitions. [2018-06-22 11:21:39,539 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:39,539 INFO ]: Found error trace [2018-06-22 11:21:39,539 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:39,539 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:39,539 INFO ]: Analyzing trace with hash -2001341418, now seen corresponding path program 1 times [2018-06-22 11:21:39,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:39,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:39,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:39,540 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:39,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:39,556 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:39,620 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:39,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:39,621 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:39,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:39,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:39,656 INFO ]: Computing forward predicates... [2018-06-22 11:21:39,780 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:39,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:39,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:21:39,799 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:21:39,799 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:21:39,799 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:39,799 INFO ]: Start difference. First operand 55 states and 153 transitions. Second operand 12 states. [2018-06-22 11:21:41,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:41,594 INFO ]: Finished difference Result 95 states and 358 transitions. [2018-06-22 11:21:41,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:21:41,594 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:21:41,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:41,596 INFO ]: With dead ends: 95 [2018-06-22 11:21:41,596 INFO ]: Without dead ends: 95 [2018-06-22 11:21:41,596 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:21:41,596 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:21:41,615 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 61. [2018-06-22 11:21:41,615 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:21:41,616 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 185 transitions. [2018-06-22 11:21:41,617 INFO ]: Start accepts. Automaton has 61 states and 185 transitions. Word has length 17 [2018-06-22 11:21:41,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:41,617 INFO ]: Abstraction has 61 states and 185 transitions. [2018-06-22 11:21:41,617 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:21:41,617 INFO ]: Start isEmpty. Operand 61 states and 185 transitions. [2018-06-22 11:21:41,624 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:41,624 INFO ]: Found error trace [2018-06-22 11:21:41,624 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:41,624 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:41,625 INFO ]: Analyzing trace with hash -181627040, now seen corresponding path program 1 times [2018-06-22 11:21:41,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:41,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:41,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:41,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:41,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:41,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:41,990 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:41,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:41,990 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) [2018-06-22 11:21:42,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:42,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:42,033 INFO ]: Computing forward predicates... [2018-06-22 11:21:42,133 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:42,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:42,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:21:42,152 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:21:42,152 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:21:42,152 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:42,153 INFO ]: Start difference. First operand 61 states and 185 transitions. Second operand 12 states. [2018-06-22 11:21:42,452 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-06-22 11:21:42,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:42,797 INFO ]: Finished difference Result 91 states and 333 transitions. [2018-06-22 11:21:42,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:21:42,798 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:21:42,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:42,799 INFO ]: With dead ends: 91 [2018-06-22 11:21:42,799 INFO ]: Without dead ends: 91 [2018-06-22 11:21:42,799 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:21:42,800 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:21:42,815 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 63. [2018-06-22 11:21:42,815 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:21:42,816 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 188 transitions. [2018-06-22 11:21:42,816 INFO ]: Start accepts. Automaton has 63 states and 188 transitions. Word has length 17 [2018-06-22 11:21:42,816 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:42,816 INFO ]: Abstraction has 63 states and 188 transitions. [2018-06-22 11:21:42,816 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:21:42,816 INFO ]: Start isEmpty. Operand 63 states and 188 transitions. [2018-06-22 11:21:42,818 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:42,818 INFO ]: Found error trace [2018-06-22 11:21:42,818 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:42,818 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:42,819 INFO ]: Analyzing trace with hash 1711537959, now seen corresponding path program 1 times [2018-06-22 11:21:42,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:42,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:42,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:42,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:42,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:42,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:42,918 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:42,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:42,918 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:42,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:42,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:42,935 INFO ]: Computing forward predicates... [2018-06-22 11:21:42,979 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:42,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:42,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:21:42,998 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:21:42,998 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:21:42,998 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:42,998 INFO ]: Start difference. First operand 63 states and 188 transitions. Second operand 10 states. [2018-06-22 11:21:43,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:43,614 INFO ]: Finished difference Result 93 states and 338 transitions. [2018-06-22 11:21:43,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:21:43,615 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:21:43,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:43,616 INFO ]: With dead ends: 93 [2018-06-22 11:21:43,616 INFO ]: Without dead ends: 93 [2018-06-22 11:21:43,617 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:21:43,617 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:21:43,629 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 71. [2018-06-22 11:21:43,629 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:21:43,630 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 225 transitions. [2018-06-22 11:21:43,630 INFO ]: Start accepts. Automaton has 71 states and 225 transitions. Word has length 17 [2018-06-22 11:21:43,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:43,630 INFO ]: Abstraction has 71 states and 225 transitions. [2018-06-22 11:21:43,630 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:21:43,630 INFO ]: Start isEmpty. Operand 71 states and 225 transitions. [2018-06-22 11:21:43,632 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:43,632 INFO ]: Found error trace [2018-06-22 11:21:43,632 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:43,632 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:43,633 INFO ]: Analyzing trace with hash -1589229861, now seen corresponding path program 1 times [2018-06-22 11:21:43,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:43,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:43,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:43,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:43,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:43,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:43,693 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:43,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:43,693 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) [2018-06-22 11:21:43,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:43,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:43,720 INFO ]: Computing forward predicates... [2018-06-22 11:21:43,759 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:43,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:43,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:21:43,778 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:21:43,778 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:21:43,778 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:43,778 INFO ]: Start difference. First operand 71 states and 225 transitions. Second operand 10 states. [2018-06-22 11:21:43,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:43,950 INFO ]: Finished difference Result 85 states and 296 transitions. [2018-06-22 11:21:43,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:21:43,950 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:21:43,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:43,952 INFO ]: With dead ends: 85 [2018-06-22 11:21:43,952 INFO ]: Without dead ends: 85 [2018-06-22 11:21:43,952 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:43,952 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:21:43,962 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-06-22 11:21:43,962 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:21:43,963 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 244 transitions. [2018-06-22 11:21:43,963 INFO ]: Start accepts. Automaton has 75 states and 244 transitions. Word has length 17 [2018-06-22 11:21:43,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:43,964 INFO ]: Abstraction has 75 states and 244 transitions. [2018-06-22 11:21:43,964 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:21:43,964 INFO ]: Start isEmpty. Operand 75 states and 244 transitions. [2018-06-22 11:21:43,969 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:43,969 INFO ]: Found error trace [2018-06-22 11:21:43,969 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:43,969 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:43,969 INFO ]: Analyzing trace with hash 2123649516, now seen corresponding path program 1 times [2018-06-22 11:21:43,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:43,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:43,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:43,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:43,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:43,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:44,122 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:44,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:44,122 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:44,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:44,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:44,140 INFO ]: Computing forward predicates... [2018-06-22 11:21:44,192 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:44,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:44,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:21:44,214 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:21:44,214 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:21:44,214 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:44,214 INFO ]: Start difference. First operand 75 states and 244 transitions. Second operand 12 states. [2018-06-22 11:21:44,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:44,542 INFO ]: Finished difference Result 107 states and 392 transitions. [2018-06-22 11:21:44,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:21:44,543 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:21:44,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:44,544 INFO ]: With dead ends: 107 [2018-06-22 11:21:44,544 INFO ]: Without dead ends: 107 [2018-06-22 11:21:44,545 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:21:44,545 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:21:44,561 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-06-22 11:21:44,561 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:21:44,562 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 244 transitions. [2018-06-22 11:21:44,563 INFO ]: Start accepts. Automaton has 75 states and 244 transitions. Word has length 17 [2018-06-22 11:21:44,563 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:44,563 INFO ]: Abstraction has 75 states and 244 transitions. [2018-06-22 11:21:44,563 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:21:44,563 INFO ]: Start isEmpty. Operand 75 states and 244 transitions. [2018-06-22 11:21:44,565 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:44,565 INFO ]: Found error trace [2018-06-22 11:21:44,565 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:44,565 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:44,565 INFO ]: Analyzing trace with hash 1427682521, now seen corresponding path program 1 times [2018-06-22 11:21:44,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:44,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:44,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:44,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:44,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:44,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:44,622 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:44,622 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:44,622 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:44,622 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:44,622 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:44,622 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:44,622 INFO ]: Start difference. First operand 75 states and 244 transitions. Second operand 4 states. [2018-06-22 11:21:44,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:44,675 INFO ]: Finished difference Result 87 states and 282 transitions. [2018-06-22 11:21:44,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:21:44,675 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:21:44,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:44,676 INFO ]: With dead ends: 87 [2018-06-22 11:21:44,676 INFO ]: Without dead ends: 87 [2018-06-22 11:21:44,676 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:21:44,676 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:21:44,685 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-06-22 11:21:44,685 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:21:44,686 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 268 transitions. [2018-06-22 11:21:44,686 INFO ]: Start accepts. Automaton has 83 states and 268 transitions. Word has length 17 [2018-06-22 11:21:44,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:44,686 INFO ]: Abstraction has 83 states and 268 transitions. [2018-06-22 11:21:44,686 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:44,686 INFO ]: Start isEmpty. Operand 83 states and 268 transitions. [2018-06-22 11:21:44,691 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:21:44,691 INFO ]: Found error trace [2018-06-22 11:21:44,691 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:44,691 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:44,691 INFO ]: Analyzing trace with hash -474798833, now seen corresponding path program 1 times [2018-06-22 11:21:44,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:44,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:44,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:44,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:44,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:44,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:45,012 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:45,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:45,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:21:45,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:45,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:45,042 INFO ]: Computing forward predicates... [2018-06-22 11:21:45,076 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:21:45,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:45,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:21:45,095 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:21:45,095 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:21:45,095 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:21:45,095 INFO ]: Start difference. First operand 83 states and 268 transitions. Second operand 10 states. [2018-06-22 11:21:45,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:45,407 INFO ]: Finished difference Result 97 states and 338 transitions. [2018-06-22 11:21:45,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:21:45,408 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:21:45,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:45,409 INFO ]: With dead ends: 97 [2018-06-22 11:21:45,409 INFO ]: Without dead ends: 97 [2018-06-22 11:21:45,410 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:45,410 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:21:45,422 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 81. [2018-06-22 11:21:45,422 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:21:45,423 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 256 transitions. [2018-06-22 11:21:45,423 INFO ]: Start accepts. Automaton has 81 states and 256 transitions. Word has length 17 [2018-06-22 11:21:45,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:45,423 INFO ]: Abstraction has 81 states and 256 transitions. [2018-06-22 11:21:45,423 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:21:45,423 INFO ]: Start isEmpty. Operand 81 states and 256 transitions. [2018-06-22 11:21:45,425 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:45,425 INFO ]: Found error trace [2018-06-22 11:21:45,425 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:45,425 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:45,425 INFO ]: Analyzing trace with hash 829480137, now seen corresponding path program 2 times [2018-06-22 11:21:45,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:45,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:45,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:45,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:45,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:45,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:45,721 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:45,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:45,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:45,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:21:45,769 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:45,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:45,771 INFO ]: Computing forward predicates... [2018-06-22 11:21:45,877 INFO ]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:45,896 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:45,896 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:21:45,896 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:21:45,896 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:21:45,896 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:21:45,897 INFO ]: Start difference. First operand 81 states and 256 transitions. Second operand 14 states. [2018-06-22 11:21:46,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:46,360 INFO ]: Finished difference Result 107 states and 388 transitions. [2018-06-22 11:21:46,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:21:46,361 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:21:46,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:46,362 INFO ]: With dead ends: 107 [2018-06-22 11:21:46,362 INFO ]: Without dead ends: 107 [2018-06-22 11:21:46,363 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:21:46,363 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:21:46,376 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 81. [2018-06-22 11:21:46,376 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:21:46,378 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 256 transitions. [2018-06-22 11:21:46,378 INFO ]: Start accepts. Automaton has 81 states and 256 transitions. Word has length 21 [2018-06-22 11:21:46,378 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:46,378 INFO ]: Abstraction has 81 states and 256 transitions. [2018-06-22 11:21:46,378 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:21:46,378 INFO ]: Start isEmpty. Operand 81 states and 256 transitions. [2018-06-22 11:21:46,380 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:46,380 INFO ]: Found error trace [2018-06-22 11:21:46,380 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:46,380 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:46,380 INFO ]: Analyzing trace with hash -1286915168, now seen corresponding path program 1 times [2018-06-22 11:21:46,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:46,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:46,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:46,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:46,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:46,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:46,418 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:21:46,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:21:46,418 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:21:46,419 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:21:46,419 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:21:46,419 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:21:46,419 INFO ]: Start difference. First operand 81 states and 256 transitions. Second operand 4 states. [2018-06-22 11:21:46,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:46,466 INFO ]: Finished difference Result 81 states and 246 transitions. [2018-06-22 11:21:46,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:21:46,468 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:21:46,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:46,469 INFO ]: With dead ends: 81 [2018-06-22 11:21:46,469 INFO ]: Without dead ends: 69 [2018-06-22 11:21:46,470 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:21:46,470 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:21:46,481 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 11:21:46,481 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:21:46,482 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 173 transitions. [2018-06-22 11:21:46,482 INFO ]: Start accepts. Automaton has 69 states and 173 transitions. Word has length 21 [2018-06-22 11:21:46,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:46,482 INFO ]: Abstraction has 69 states and 173 transitions. [2018-06-22 11:21:46,482 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:21:46,482 INFO ]: Start isEmpty. Operand 69 states and 173 transitions. [2018-06-22 11:21:46,483 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:46,483 INFO ]: Found error trace [2018-06-22 11:21:46,483 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:46,483 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:46,483 INFO ]: Analyzing trace with hash -647802598, now seen corresponding path program 3 times [2018-06-22 11:21:46,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:46,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:46,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:46,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:46,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:46,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:46,739 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:46,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:46,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:46,745 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:21:46,773 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:21:46,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:46,774 INFO ]: Computing forward predicates... [2018-06-22 11:21:46,878 INFO ]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:46,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:46,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:21:46,900 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:21:46,900 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:21:46,901 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:21:46,901 INFO ]: Start difference. First operand 69 states and 173 transitions. Second operand 18 states. [2018-06-22 11:21:48,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:48,775 INFO ]: Finished difference Result 147 states and 449 transitions. [2018-06-22 11:21:48,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:21:48,776 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:21:48,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:48,777 INFO ]: With dead ends: 147 [2018-06-22 11:21:48,777 INFO ]: Without dead ends: 147 [2018-06-22 11:21:48,778 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:21:48,778 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 11:21:48,795 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-06-22 11:21:48,795 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:21:48,796 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 245 transitions. [2018-06-22 11:21:48,796 INFO ]: Start accepts. Automaton has 89 states and 245 transitions. Word has length 21 [2018-06-22 11:21:48,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:48,796 INFO ]: Abstraction has 89 states and 245 transitions. [2018-06-22 11:21:48,797 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:21:48,797 INFO ]: Start isEmpty. Operand 89 states and 245 transitions. [2018-06-22 11:21:48,798 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:48,798 INFO ]: Found error trace [2018-06-22 11:21:48,798 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:48,798 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:48,798 INFO ]: Analyzing trace with hash 2017683997, now seen corresponding path program 1 times [2018-06-22 11:21:48,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:48,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:48,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:48,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:48,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:48,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:48,908 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:48,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:48,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:48,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:48,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:48,940 INFO ]: Computing forward predicates... [2018-06-22 11:21:48,982 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:49,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:49,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:21:49,001 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:21:49,002 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:21:49,002 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:21:49,002 INFO ]: Start difference. First operand 89 states and 245 transitions. Second operand 12 states. [2018-06-22 11:21:49,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:49,393 INFO ]: Finished difference Result 117 states and 346 transitions. [2018-06-22 11:21:49,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:21:49,393 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:21:49,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:49,395 INFO ]: With dead ends: 117 [2018-06-22 11:21:49,395 INFO ]: Without dead ends: 117 [2018-06-22 11:21:49,395 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:21:49,395 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:21:49,408 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 85. [2018-06-22 11:21:49,408 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:21:49,409 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 231 transitions. [2018-06-22 11:21:49,409 INFO ]: Start accepts. Automaton has 85 states and 231 transitions. Word has length 21 [2018-06-22 11:21:49,409 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:49,409 INFO ]: Abstraction has 85 states and 231 transitions. [2018-06-22 11:21:49,409 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:21:49,409 INFO ]: Start isEmpty. Operand 85 states and 231 transitions. [2018-06-22 11:21:49,410 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:49,410 INFO ]: Found error trace [2018-06-22 11:21:49,410 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:49,410 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:49,410 INFO ]: Analyzing trace with hash -1236541620, now seen corresponding path program 2 times [2018-06-22 11:21:49,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:49,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:49,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:49,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:49,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:49,420 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:49,539 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:49,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:49,539 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:49,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:21:49,556 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:49,556 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:49,558 INFO ]: Computing forward predicates... [2018-06-22 11:21:49,763 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:21:49,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:49,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:21:49,782 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:21:49,782 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:21:49,782 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:21:49,782 INFO ]: Start difference. First operand 85 states and 231 transitions. Second operand 16 states. [2018-06-22 11:21:50,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:50,447 INFO ]: Finished difference Result 117 states and 342 transitions. [2018-06-22 11:21:50,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:21:50,448 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:21:50,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:50,449 INFO ]: With dead ends: 117 [2018-06-22 11:21:50,449 INFO ]: Without dead ends: 117 [2018-06-22 11:21:50,450 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:21:50,450 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:21:50,459 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 87. [2018-06-22 11:21:50,459 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:21:50,474 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 234 transitions. [2018-06-22 11:21:50,474 INFO ]: Start accepts. Automaton has 87 states and 234 transitions. Word has length 21 [2018-06-22 11:21:50,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:50,474 INFO ]: Abstraction has 87 states and 234 transitions. [2018-06-22 11:21:50,474 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:21:50,474 INFO ]: Start isEmpty. Operand 87 states and 234 transitions. [2018-06-22 11:21:50,475 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:50,475 INFO ]: Found error trace [2018-06-22 11:21:50,475 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:50,475 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:50,476 INFO ]: Analyzing trace with hash 948240233, now seen corresponding path program 2 times [2018-06-22 11:21:50,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:50,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:50,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:50,476 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:50,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:50,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:50,595 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:50,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:50,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:50,600 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:21:50,625 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:50,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:50,627 INFO ]: Computing forward predicates... [2018-06-22 11:21:50,705 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:50,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:50,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:21:50,724 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:21:50,724 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:21:50,724 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:21:50,724 INFO ]: Start difference. First operand 87 states and 234 transitions. Second operand 16 states. [2018-06-22 11:21:51,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:51,379 INFO ]: Finished difference Result 141 states and 418 transitions. [2018-06-22 11:21:51,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:21:51,379 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:21:51,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:51,380 INFO ]: With dead ends: 141 [2018-06-22 11:21:51,380 INFO ]: Without dead ends: 141 [2018-06-22 11:21:51,380 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:21:51,381 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:21:51,390 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 93. [2018-06-22 11:21:51,390 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:21:51,391 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 250 transitions. [2018-06-22 11:21:51,392 INFO ]: Start accepts. Automaton has 93 states and 250 transitions. Word has length 21 [2018-06-22 11:21:51,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:51,392 INFO ]: Abstraction has 93 states and 250 transitions. [2018-06-22 11:21:51,392 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:21:51,392 INFO ]: Start isEmpty. Operand 93 states and 250 transitions. [2018-06-22 11:21:51,393 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:51,393 INFO ]: Found error trace [2018-06-22 11:21:51,393 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:51,393 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:51,393 INFO ]: Analyzing trace with hash -977242152, now seen corresponding path program 1 times [2018-06-22 11:21:51,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:51,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:51,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:51,394 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:51,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:51,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:51,511 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:51,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:51,512 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:51,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:51,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:51,528 INFO ]: Computing forward predicates... [2018-06-22 11:21:51,624 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:51,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:51,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:21:51,644 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:21:51,644 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:21:51,644 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:21:51,644 INFO ]: Start difference. First operand 93 states and 250 transitions. Second operand 14 states. [2018-06-22 11:21:52,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:52,247 INFO ]: Finished difference Result 175 states and 537 transitions. [2018-06-22 11:21:52,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:21:52,247 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:21:52,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:52,249 INFO ]: With dead ends: 175 [2018-06-22 11:21:52,249 INFO ]: Without dead ends: 175 [2018-06-22 11:21:52,249 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:21:52,250 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 11:21:52,265 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 119. [2018-06-22 11:21:52,265 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:21:52,266 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 347 transitions. [2018-06-22 11:21:52,266 INFO ]: Start accepts. Automaton has 119 states and 347 transitions. Word has length 21 [2018-06-22 11:21:52,266 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:52,266 INFO ]: Abstraction has 119 states and 347 transitions. [2018-06-22 11:21:52,267 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:21:52,267 INFO ]: Start isEmpty. Operand 119 states and 347 transitions. [2018-06-22 11:21:52,268 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:21:52,268 INFO ]: Found error trace [2018-06-22 11:21:52,268 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:52,268 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:52,268 INFO ]: Analyzing trace with hash -1660369714, now seen corresponding path program 1 times [2018-06-22 11:21:52,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:52,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:52,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:52,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:52,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:52,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:52,466 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:52,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:52,466 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:52,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:52,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:52,484 INFO ]: Computing forward predicates... [2018-06-22 11:21:52,698 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:21:52,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:52,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:21:52,717 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:21:52,717 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:21:52,717 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:21:52,717 INFO ]: Start difference. First operand 119 states and 347 transitions. Second operand 16 states. [2018-06-22 11:21:54,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:54,212 INFO ]: Finished difference Result 167 states and 509 transitions. [2018-06-22 11:21:54,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:21:54,212 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:21:54,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:54,214 INFO ]: With dead ends: 167 [2018-06-22 11:21:54,214 INFO ]: Without dead ends: 167 [2018-06-22 11:21:54,215 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:21:54,215 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:21:54,230 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 115. [2018-06-22 11:21:54,231 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 11:21:54,232 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 338 transitions. [2018-06-22 11:21:54,232 INFO ]: Start accepts. Automaton has 115 states and 338 transitions. Word has length 21 [2018-06-22 11:21:54,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:54,232 INFO ]: Abstraction has 115 states and 338 transitions. [2018-06-22 11:21:54,232 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:21:54,232 INFO ]: Start isEmpty. Operand 115 states and 338 transitions. [2018-06-22 11:21:54,235 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:21:54,235 INFO ]: Found error trace [2018-06-22 11:21:54,236 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:54,236 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:54,236 INFO ]: Analyzing trace with hash 673087029, now seen corresponding path program 1 times [2018-06-22 11:21:54,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:54,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:54,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:54,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:54,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:54,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:54,595 INFO ]: Checked inductivity of 31 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:21:54,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:54,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:21:54,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:54,640 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:54,642 INFO ]: Computing forward predicates... [2018-06-22 11:21:55,230 INFO ]: Checked inductivity of 31 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:21:55,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:55,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2018-06-22 11:21:55,262 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:21:55,262 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:21:55,262 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:21:55,262 INFO ]: Start difference. First operand 115 states and 338 transitions. Second operand 14 states. [2018-06-22 11:21:55,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:55,728 INFO ]: Finished difference Result 197 states and 625 transitions. [2018-06-22 11:21:55,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:21:55,729 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:21:55,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:55,730 INFO ]: With dead ends: 197 [2018-06-22 11:21:55,730 INFO ]: Without dead ends: 197 [2018-06-22 11:21:55,731 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:21:55,731 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-22 11:21:55,754 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 167. [2018-06-22 11:21:55,754 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-22 11:21:55,755 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 518 transitions. [2018-06-22 11:21:55,756 INFO ]: Start accepts. Automaton has 167 states and 518 transitions. Word has length 25 [2018-06-22 11:21:55,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:55,756 INFO ]: Abstraction has 167 states and 518 transitions. [2018-06-22 11:21:55,756 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:21:55,756 INFO ]: Start isEmpty. Operand 167 states and 518 transitions. [2018-06-22 11:21:55,757 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:21:55,757 INFO ]: Found error trace [2018-06-22 11:21:55,757 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:55,757 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:55,758 INFO ]: Analyzing trace with hash -940118175, now seen corresponding path program 1 times [2018-06-22 11:21:55,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:55,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:55,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:55,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:55,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:55,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:55,880 INFO ]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:21:55,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:55,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:55,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:55,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:55,900 INFO ]: Computing forward predicates... [2018-06-22 11:21:56,142 INFO ]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:21:56,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:56,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:21:56,161 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:21:56,161 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:21:56,161 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:21:56,161 INFO ]: Start difference. First operand 167 states and 518 transitions. Second operand 14 states. [2018-06-22 11:21:57,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:57,229 INFO ]: Finished difference Result 195 states and 603 transitions. [2018-06-22 11:21:57,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:21:57,229 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:21:57,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:57,230 INFO ]: With dead ends: 195 [2018-06-22 11:21:57,230 INFO ]: Without dead ends: 195 [2018-06-22 11:21:57,231 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:21:57,231 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 11:21:57,246 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 175. [2018-06-22 11:21:57,246 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 11:21:57,248 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 541 transitions. [2018-06-22 11:21:57,248 INFO ]: Start accepts. Automaton has 175 states and 541 transitions. Word has length 25 [2018-06-22 11:21:57,248 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:57,248 INFO ]: Abstraction has 175 states and 541 transitions. [2018-06-22 11:21:57,248 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:21:57,248 INFO ]: Start isEmpty. Operand 175 states and 541 transitions. [2018-06-22 11:21:57,250 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:21:57,250 INFO ]: Found error trace [2018-06-22 11:21:57,250 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:57,250 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:57,250 INFO ]: Analyzing trace with hash 2117628136, now seen corresponding path program 3 times [2018-06-22 11:21:57,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:57,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:57,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:57,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:21:57,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:57,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:57,380 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:21:57,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:57,380 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:57,386 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:21:57,400 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:21:57,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:57,402 INFO ]: Computing forward predicates... [2018-06-22 11:21:57,563 INFO ]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:21:57,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:57,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:21:57,582 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:21:57,582 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:21:57,582 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:21:57,582 INFO ]: Start difference. First operand 175 states and 541 transitions. Second operand 22 states. [2018-06-22 11:21:58,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:58,797 INFO ]: Finished difference Result 229 states and 715 transitions. [2018-06-22 11:21:58,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:21:58,797 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 11:21:58,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:58,800 INFO ]: With dead ends: 229 [2018-06-22 11:21:58,800 INFO ]: Without dead ends: 229 [2018-06-22 11:21:58,801 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:21:58,801 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-22 11:21:58,820 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 179. [2018-06-22 11:21:58,820 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 11:21:58,822 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 556 transitions. [2018-06-22 11:21:58,822 INFO ]: Start accepts. Automaton has 179 states and 556 transitions. Word has length 25 [2018-06-22 11:21:58,822 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:58,822 INFO ]: Abstraction has 179 states and 556 transitions. [2018-06-22 11:21:58,822 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:21:58,822 INFO ]: Start isEmpty. Operand 179 states and 556 transitions. [2018-06-22 11:21:58,824 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:21:58,824 INFO ]: Found error trace [2018-06-22 11:21:58,824 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:21:58,824 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:21:58,824 INFO ]: Analyzing trace with hash -1435006569, now seen corresponding path program 4 times [2018-06-22 11:21:58,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:21:58,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:21:58,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:58,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:21:58,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:21:58,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:59,814 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:21:59,814 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:21:59,814 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:21:59,819 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:21:59,834 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:21:59,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:59,836 INFO ]: Computing forward predicates... [2018-06-22 11:21:59,950 INFO ]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:21:59,968 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:59,968 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-06-22 11:21:59,969 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:21:59,969 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:21:59,969 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:21:59,969 INFO ]: Start difference. First operand 179 states and 556 transitions. Second operand 18 states. [2018-06-22 11:22:01,640 WARN ]: Spent 294.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-06-22 11:22:02,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:02,878 INFO ]: Finished difference Result 387 states and 1267 transitions. [2018-06-22 11:22:02,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:22:02,878 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:22:02,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:02,882 INFO ]: With dead ends: 387 [2018-06-22 11:22:02,882 INFO ]: Without dead ends: 387 [2018-06-22 11:22:02,883 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=621, Invalid=3039, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:22:02,883 INFO ]: Start minimizeSevpa. Operand 387 states. [2018-06-22 11:22:02,922 INFO ]: Finished minimizeSevpa. Reduced states from 387 to 243. [2018-06-22 11:22:02,923 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 11:22:02,925 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 774 transitions. [2018-06-22 11:22:02,925 INFO ]: Start accepts. Automaton has 243 states and 774 transitions. Word has length 25 [2018-06-22 11:22:02,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:02,925 INFO ]: Abstraction has 243 states and 774 transitions. [2018-06-22 11:22:02,926 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:02,926 INFO ]: Start isEmpty. Operand 243 states and 774 transitions. [2018-06-22 11:22:02,929 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:02,929 INFO ]: Found error trace [2018-06-22 11:22:02,929 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:02,929 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:02,929 INFO ]: Analyzing trace with hash 1351527157, now seen corresponding path program 5 times [2018-06-22 11:22:02,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:02,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:02,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:02,930 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:02,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:02,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:03,164 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:03,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:03,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:03,175 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:22:03,190 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:22:03,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:03,192 INFO ]: Computing forward predicates... [2018-06-22 11:22:03,274 INFO ]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:03,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:03,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-06-22 11:22:03,305 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:22:03,306 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:22:03,306 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:03,306 INFO ]: Start difference. First operand 243 states and 774 transitions. Second operand 17 states. [2018-06-22 11:22:04,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:04,098 INFO ]: Finished difference Result 363 states and 1184 transitions. [2018-06-22 11:22:04,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:22:04,098 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:22:04,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:04,102 INFO ]: With dead ends: 363 [2018-06-22 11:22:04,102 INFO ]: Without dead ends: 363 [2018-06-22 11:22:04,102 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:22:04,102 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:22:04,132 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 255. [2018-06-22 11:22:04,132 INFO ]: Start removeUnreachable. Operand 255 states. [2018-06-22 11:22:04,134 INFO ]: Finished removeUnreachable. Reduced from 255 states to 255 states and 814 transitions. [2018-06-22 11:22:04,134 INFO ]: Start accepts. Automaton has 255 states and 814 transitions. Word has length 25 [2018-06-22 11:22:04,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:04,135 INFO ]: Abstraction has 255 states and 814 transitions. [2018-06-22 11:22:04,135 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:22:04,135 INFO ]: Start isEmpty. Operand 255 states and 814 transitions. [2018-06-22 11:22:04,137 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:04,137 INFO ]: Found error trace [2018-06-22 11:22:04,137 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:04,137 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:04,137 INFO ]: Analyzing trace with hash -235640907, now seen corresponding path program 6 times [2018-06-22 11:22:04,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:04,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:04,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:04,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:04,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:04,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:04,743 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:04,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:04,743 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:04,751 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:22:04,766 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:22:04,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:04,767 INFO ]: Computing forward predicates... [2018-06-22 11:22:04,960 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:04,981 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:04,981 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:22:04,982 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:22:04,982 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:22:04,982 INFO ]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:22:04,982 INFO ]: Start difference. First operand 255 states and 814 transitions. Second operand 22 states. [2018-06-22 11:22:06,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:06,913 INFO ]: Finished difference Result 385 states and 1269 transitions. [2018-06-22 11:22:06,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 11:22:06,914 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 11:22:06,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:06,916 INFO ]: With dead ends: 385 [2018-06-22 11:22:06,916 INFO ]: Without dead ends: 385 [2018-06-22 11:22:06,917 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=409, Invalid=2783, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:22:06,917 INFO ]: Start minimizeSevpa. Operand 385 states. [2018-06-22 11:22:06,939 INFO ]: Finished minimizeSevpa. Reduced states from 385 to 277. [2018-06-22 11:22:06,939 INFO ]: Start removeUnreachable. Operand 277 states. [2018-06-22 11:22:06,941 INFO ]: Finished removeUnreachable. Reduced from 277 states to 277 states and 890 transitions. [2018-06-22 11:22:06,941 INFO ]: Start accepts. Automaton has 277 states and 890 transitions. Word has length 25 [2018-06-22 11:22:06,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:06,941 INFO ]: Abstraction has 277 states and 890 transitions. [2018-06-22 11:22:06,941 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:22:06,941 INFO ]: Start isEmpty. Operand 277 states and 890 transitions. [2018-06-22 11:22:06,943 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:06,943 INFO ]: Found error trace [2018-06-22 11:22:06,943 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:06,943 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:06,943 INFO ]: Analyzing trace with hash -1552599947, now seen corresponding path program 7 times [2018-06-22 11:22:06,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:06,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:06,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:06,944 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:06,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:06,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:07,025 INFO ]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:07,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:07,025 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:07,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:07,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:07,047 INFO ]: Computing forward predicates... [2018-06-22 11:22:07,200 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:07,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:07,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-22 11:22:07,219 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:22:07,219 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:22:07,219 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:22:07,219 INFO ]: Start difference. First operand 277 states and 890 transitions. Second operand 21 states. [2018-06-22 11:22:07,449 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-22 11:22:08,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:08,970 INFO ]: Finished difference Result 393 states and 1300 transitions. [2018-06-22 11:22:08,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:22:08,970 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:22:08,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:08,973 INFO ]: With dead ends: 393 [2018-06-22 11:22:08,973 INFO ]: Without dead ends: 393 [2018-06-22 11:22:08,974 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:22:08,974 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 11:22:08,999 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 281. [2018-06-22 11:22:08,999 INFO ]: Start removeUnreachable. Operand 281 states. [2018-06-22 11:22:09,002 INFO ]: Finished removeUnreachable. Reduced from 281 states to 281 states and 911 transitions. [2018-06-22 11:22:09,002 INFO ]: Start accepts. Automaton has 281 states and 911 transitions. Word has length 25 [2018-06-22 11:22:09,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:09,002 INFO ]: Abstraction has 281 states and 911 transitions. [2018-06-22 11:22:09,002 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:22:09,002 INFO ]: Start isEmpty. Operand 281 states and 911 transitions. [2018-06-22 11:22:09,005 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:09,005 INFO ]: Found error trace [2018-06-22 11:22:09,005 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:09,005 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:09,005 INFO ]: Analyzing trace with hash -871131949, now seen corresponding path program 1 times [2018-06-22 11:22:09,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:09,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:09,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:09,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:09,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:09,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:09,100 INFO ]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:09,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:09,133 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:09,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:09,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:09,153 INFO ]: Computing forward predicates... [2018-06-22 11:22:09,239 INFO ]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:09,259 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:09,259 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:22:09,259 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:22:09,259 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:22:09,259 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:09,259 INFO ]: Start difference. First operand 281 states and 911 transitions. Second operand 14 states. [2018-06-22 11:22:09,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:09,830 INFO ]: Finished difference Result 283 states and 903 transitions. [2018-06-22 11:22:09,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:22:09,830 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:22:09,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:09,832 INFO ]: With dead ends: 283 [2018-06-22 11:22:09,832 INFO ]: Without dead ends: 283 [2018-06-22 11:22:09,833 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:22:09,833 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-22 11:22:09,856 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 235. [2018-06-22 11:22:09,856 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-22 11:22:09,858 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 734 transitions. [2018-06-22 11:22:09,858 INFO ]: Start accepts. Automaton has 235 states and 734 transitions. Word has length 25 [2018-06-22 11:22:09,858 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:09,858 INFO ]: Abstraction has 235 states and 734 transitions. [2018-06-22 11:22:09,858 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:22:09,858 INFO ]: Start isEmpty. Operand 235 states and 734 transitions. [2018-06-22 11:22:09,861 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:09,861 INFO ]: Found error trace [2018-06-22 11:22:09,861 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:09,861 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:09,861 INFO ]: Analyzing trace with hash -810267356, now seen corresponding path program 3 times [2018-06-22 11:22:09,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:09,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:09,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:09,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:09,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:09,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:10,043 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:22:10,376 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:10,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:10,376 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:10,381 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:10,396 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:22:10,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:10,398 INFO ]: Computing forward predicates... [2018-06-22 11:22:10,548 INFO ]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:10,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:10,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:22:10,567 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:22:10,567 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:22:10,567 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:22:10,567 INFO ]: Start difference. First operand 235 states and 734 transitions. Second operand 20 states. [2018-06-22 11:22:11,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:11,305 INFO ]: Finished difference Result 277 states and 881 transitions. [2018-06-22 11:22:11,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:22:11,307 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:22:11,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:11,310 INFO ]: With dead ends: 277 [2018-06-22 11:22:11,310 INFO ]: Without dead ends: 277 [2018-06-22 11:22:11,310 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:22:11,310 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 11:22:11,333 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 239. [2018-06-22 11:22:11,333 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:22:11,339 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 747 transitions. [2018-06-22 11:22:11,339 INFO ]: Start accepts. Automaton has 239 states and 747 transitions. Word has length 25 [2018-06-22 11:22:11,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:11,339 INFO ]: Abstraction has 239 states and 747 transitions. [2018-06-22 11:22:11,339 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:22:11,339 INFO ]: Start isEmpty. Operand 239 states and 747 transitions. [2018-06-22 11:22:11,342 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:11,342 INFO ]: Found error trace [2018-06-22 11:22:11,342 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:11,342 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:11,342 INFO ]: Analyzing trace with hash -623687752, now seen corresponding path program 3 times [2018-06-22 11:22:11,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:11,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:11,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:11,345 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:11,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:11,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:11,453 INFO ]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:11,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:11,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:11,458 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:11,473 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:22:11,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:11,474 INFO ]: Computing forward predicates... [2018-06-22 11:22:12,096 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:12,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:12,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 11:22:12,128 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:22:12,128 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:22:12,128 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:22:12,128 INFO ]: Start difference. First operand 239 states and 747 transitions. Second operand 20 states. [2018-06-22 11:22:13,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:13,307 INFO ]: Finished difference Result 273 states and 865 transitions. [2018-06-22 11:22:13,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:22:13,307 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:22:13,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:13,309 INFO ]: With dead ends: 273 [2018-06-22 11:22:13,309 INFO ]: Without dead ends: 273 [2018-06-22 11:22:13,309 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:22:13,309 INFO ]: Start minimizeSevpa. Operand 273 states. [2018-06-22 11:22:13,323 INFO ]: Finished minimizeSevpa. Reduced states from 273 to 239. [2018-06-22 11:22:13,323 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:22:13,324 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 743 transitions. [2018-06-22 11:22:13,324 INFO ]: Start accepts. Automaton has 239 states and 743 transitions. Word has length 25 [2018-06-22 11:22:13,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:13,324 INFO ]: Abstraction has 239 states and 743 transitions. [2018-06-22 11:22:13,324 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:22:13,324 INFO ]: Start isEmpty. Operand 239 states and 743 transitions. [2018-06-22 11:22:13,326 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:13,326 INFO ]: Found error trace [2018-06-22 11:22:13,326 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:13,326 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:13,326 INFO ]: Analyzing trace with hash -872184424, now seen corresponding path program 1 times [2018-06-22 11:22:13,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:13,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:13,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:13,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:13,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:13,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:13,653 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:13,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:13,653 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:13,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:13,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:13,671 INFO ]: Computing forward predicates... [2018-06-22 11:22:13,785 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:13,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:13,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:22:13,804 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:22:13,804 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:22:13,804 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:13,804 INFO ]: Start difference. First operand 239 states and 743 transitions. Second operand 16 states. [2018-06-22 11:22:14,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:14,334 INFO ]: Finished difference Result 281 states and 873 transitions. [2018-06-22 11:22:14,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:22:14,335 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:22:14,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:14,337 INFO ]: With dead ends: 281 [2018-06-22 11:22:14,337 INFO ]: Without dead ends: 281 [2018-06-22 11:22:14,338 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:22:14,338 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 11:22:14,361 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 237. [2018-06-22 11:22:14,361 INFO ]: Start removeUnreachable. Operand 237 states. [2018-06-22 11:22:14,363 INFO ]: Finished removeUnreachable. Reduced from 237 states to 237 states and 724 transitions. [2018-06-22 11:22:14,363 INFO ]: Start accepts. Automaton has 237 states and 724 transitions. Word has length 25 [2018-06-22 11:22:14,363 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:14,363 INFO ]: Abstraction has 237 states and 724 transitions. [2018-06-22 11:22:14,363 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:22:14,363 INFO ]: Start isEmpty. Operand 237 states and 724 transitions. [2018-06-22 11:22:14,365 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:14,365 INFO ]: Found error trace [2018-06-22 11:22:14,365 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:14,365 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:14,366 INFO ]: Analyzing trace with hash 444774616, now seen corresponding path program 2 times [2018-06-22 11:22:14,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:14,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:14,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:14,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:14,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:14,373 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:15,013 INFO ]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:22:15,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:15,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:22:15,026 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:15,069 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:15,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:15,071 INFO ]: Computing forward predicates... [2018-06-22 11:22:15,800 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:15,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:15,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2018-06-22 11:22:15,818 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:22:15,818 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:22:15,819 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:15,819 INFO ]: Start difference. First operand 237 states and 724 transitions. Second operand 17 states. [2018-06-22 11:22:16,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:16,499 INFO ]: Finished difference Result 299 states and 822 transitions. [2018-06-22 11:22:16,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:22:16,499 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:22:16,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:16,501 INFO ]: With dead ends: 299 [2018-06-22 11:22:16,501 INFO ]: Without dead ends: 299 [2018-06-22 11:22:16,501 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:22:16,502 INFO ]: Start minimizeSevpa. Operand 299 states. [2018-06-22 11:22:16,516 INFO ]: Finished minimizeSevpa. Reduced states from 299 to 267. [2018-06-22 11:22:16,516 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-22 11:22:16,517 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 764 transitions. [2018-06-22 11:22:16,517 INFO ]: Start accepts. Automaton has 267 states and 764 transitions. Word has length 25 [2018-06-22 11:22:16,517 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:16,517 INFO ]: Abstraction has 267 states and 764 transitions. [2018-06-22 11:22:16,517 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:22:16,517 INFO ]: Start isEmpty. Operand 267 states and 764 transitions. [2018-06-22 11:22:16,520 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:16,520 INFO ]: Found error trace [2018-06-22 11:22:16,520 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:16,520 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:16,520 INFO ]: Analyzing trace with hash -1166198489, now seen corresponding path program 1 times [2018-06-22 11:22:16,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:16,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:16,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:16,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:16,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:16,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:16,612 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:16,613 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:16,613 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:22:16,613 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:22:16,613 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:22:16,613 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:22:16,613 INFO ]: Start difference. First operand 267 states and 764 transitions. Second operand 6 states. [2018-06-22 11:22:16,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:16,728 INFO ]: Finished difference Result 287 states and 833 transitions. [2018-06-22 11:22:16,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:22:16,728 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:22:16,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:16,730 INFO ]: With dead ends: 287 [2018-06-22 11:22:16,730 INFO ]: Without dead ends: 287 [2018-06-22 11:22:16,730 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:22:16,730 INFO ]: Start minimizeSevpa. Operand 287 states. [2018-06-22 11:22:16,762 INFO ]: Finished minimizeSevpa. Reduced states from 287 to 269. [2018-06-22 11:22:16,762 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-22 11:22:16,764 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 769 transitions. [2018-06-22 11:22:16,764 INFO ]: Start accepts. Automaton has 269 states and 769 transitions. Word has length 25 [2018-06-22 11:22:16,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:16,764 INFO ]: Abstraction has 269 states and 769 transitions. [2018-06-22 11:22:16,764 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:22:16,764 INFO ]: Start isEmpty. Operand 269 states and 769 transitions. [2018-06-22 11:22:16,766 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:16,766 INFO ]: Found error trace [2018-06-22 11:22:16,766 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:16,766 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:16,767 INFO ]: Analyzing trace with hash 1753015089, now seen corresponding path program 1 times [2018-06-22 11:22:16,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:16,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:16,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:16,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:16,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:16,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:16,827 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:22:16,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:16,827 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:16,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:16,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:16,845 INFO ]: Computing forward predicates... [2018-06-22 11:22:16,863 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:22:16,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:16,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:22:16,895 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:22:16,895 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:22:16,895 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:22:16,895 INFO ]: Start difference. First operand 269 states and 769 transitions. Second operand 9 states. [2018-06-22 11:22:17,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:17,103 INFO ]: Finished difference Result 283 states and 818 transitions. [2018-06-22 11:22:17,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:17,103 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:22:17,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:17,105 INFO ]: With dead ends: 283 [2018-06-22 11:22:17,105 INFO ]: Without dead ends: 283 [2018-06-22 11:22:17,105 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:17,105 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-22 11:22:17,121 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 263. [2018-06-22 11:22:17,121 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 11:22:17,122 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 748 transitions. [2018-06-22 11:22:17,123 INFO ]: Start accepts. Automaton has 263 states and 748 transitions. Word has length 25 [2018-06-22 11:22:17,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:17,123 INFO ]: Abstraction has 263 states and 748 transitions. [2018-06-22 11:22:17,123 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:22:17,123 INFO ]: Start isEmpty. Operand 263 states and 748 transitions. [2018-06-22 11:22:17,125 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:17,125 INFO ]: Found error trace [2018-06-22 11:22:17,125 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:17,125 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:17,125 INFO ]: Analyzing trace with hash -395481360, now seen corresponding path program 1 times [2018-06-22 11:22:17,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:17,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:17,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:17,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:17,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:17,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:17,790 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:17,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:17,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:22:17,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:17,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:17,835 INFO ]: Computing forward predicates... [2018-06-22 11:22:18,384 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:18,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:18,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:22:18,408 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:22:18,408 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:22:18,408 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:22:18,408 INFO ]: Start difference. First operand 263 states and 748 transitions. Second operand 15 states. [2018-06-22 11:22:19,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:19,056 INFO ]: Finished difference Result 315 states and 906 transitions. [2018-06-22 11:22:19,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:22:19,056 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:22:19,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:19,058 INFO ]: With dead ends: 315 [2018-06-22 11:22:19,058 INFO ]: Without dead ends: 315 [2018-06-22 11:22:19,058 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:22:19,058 INFO ]: Start minimizeSevpa. Operand 315 states. [2018-06-22 11:22:19,073 INFO ]: Finished minimizeSevpa. Reduced states from 315 to 263. [2018-06-22 11:22:19,073 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 11:22:19,075 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 744 transitions. [2018-06-22 11:22:19,075 INFO ]: Start accepts. Automaton has 263 states and 744 transitions. Word has length 25 [2018-06-22 11:22:19,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:19,075 INFO ]: Abstraction has 263 states and 744 transitions. [2018-06-22 11:22:19,075 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:22:19,075 INFO ]: Start isEmpty. Operand 263 states and 744 transitions. [2018-06-22 11:22:19,078 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:19,078 INFO ]: Found error trace [2018-06-22 11:22:19,078 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:19,078 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:19,078 INFO ]: Analyzing trace with hash -1106015694, now seen corresponding path program 8 times [2018-06-22 11:22:19,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:19,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:19,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:19,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:19,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:19,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:19,280 INFO ]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:22:19,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:19,280 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:19,285 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:19,300 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:19,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:19,302 INFO ]: Computing forward predicates... [2018-06-22 11:22:19,447 INFO ]: Checked inductivity of 49 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:22:19,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:19,466 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-22 11:22:19,466 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:22:19,466 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:22:19,466 INFO ]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:22:19,466 INFO ]: Start difference. First operand 263 states and 744 transitions. Second operand 21 states. [2018-06-22 11:22:20,542 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-06-22 11:22:21,093 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 11:22:21,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:21,700 INFO ]: Finished difference Result 677 states and 2045 transitions. [2018-06-22 11:22:21,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:22:21,700 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:22:21,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:21,704 INFO ]: With dead ends: 677 [2018-06-22 11:22:21,704 INFO ]: Without dead ends: 677 [2018-06-22 11:22:21,705 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=791, Invalid=3369, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 11:22:21,705 INFO ]: Start minimizeSevpa. Operand 677 states. [2018-06-22 11:22:21,749 INFO ]: Finished minimizeSevpa. Reduced states from 677 to 387. [2018-06-22 11:22:21,749 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 11:22:21,751 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1139 transitions. [2018-06-22 11:22:21,751 INFO ]: Start accepts. Automaton has 387 states and 1139 transitions. Word has length 29 [2018-06-22 11:22:21,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:21,751 INFO ]: Abstraction has 387 states and 1139 transitions. [2018-06-22 11:22:21,751 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:22:21,751 INFO ]: Start isEmpty. Operand 387 states and 1139 transitions. [2018-06-22 11:22:21,755 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:21,755 INFO ]: Found error trace [2018-06-22 11:22:21,755 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:21,755 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:21,755 INFO ]: Analyzing trace with hash -1038830792, now seen corresponding path program 1 times [2018-06-22 11:22:21,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:21,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:21,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:21,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:21,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:21,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:22,064 INFO ]: Checked inductivity of 46 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:22:22,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:22,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:22,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:22,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:22,091 INFO ]: Computing forward predicates... [2018-06-22 11:22:22,190 INFO ]: Checked inductivity of 46 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:22:22,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:22,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:22:22,209 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:22:22,209 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:22:22,209 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:22,209 INFO ]: Start difference. First operand 387 states and 1139 transitions. Second operand 16 states. [2018-06-22 11:22:23,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:23,160 INFO ]: Finished difference Result 515 states and 1512 transitions. [2018-06-22 11:22:23,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:22:23,162 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:22:23,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:23,165 INFO ]: With dead ends: 515 [2018-06-22 11:22:23,165 INFO ]: Without dead ends: 515 [2018-06-22 11:22:23,166 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:22:23,166 INFO ]: Start minimizeSevpa. Operand 515 states. [2018-06-22 11:22:23,190 INFO ]: Finished minimizeSevpa. Reduced states from 515 to 377. [2018-06-22 11:22:23,190 INFO ]: Start removeUnreachable. Operand 377 states. [2018-06-22 11:22:23,193 INFO ]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1101 transitions. [2018-06-22 11:22:23,193 INFO ]: Start accepts. Automaton has 377 states and 1101 transitions. Word has length 29 [2018-06-22 11:22:23,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:23,193 INFO ]: Abstraction has 377 states and 1101 transitions. [2018-06-22 11:22:23,193 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:22:23,193 INFO ]: Start isEmpty. Operand 377 states and 1101 transitions. [2018-06-22 11:22:23,196 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:23,196 INFO ]: Found error trace [2018-06-22 11:22:23,196 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:23,197 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:23,197 INFO ]: Analyzing trace with hash 2130233761, now seen corresponding path program 9 times [2018-06-22 11:22:23,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:23,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:23,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:23,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:23,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:23,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:23,338 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:22:23,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:23,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:23,344 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:23,361 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:22:23,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:23,362 INFO ]: Computing forward predicates... [2018-06-22 11:22:23,535 INFO ]: Checked inductivity of 51 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:22:23,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:23,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2018-06-22 11:22:23,554 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:22:23,554 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:22:23,554 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:22:23,554 INFO ]: Start difference. First operand 377 states and 1101 transitions. Second operand 20 states. [2018-06-22 11:22:24,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:24,069 INFO ]: Finished difference Result 535 states and 1625 transitions. [2018-06-22 11:22:24,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:22:24,070 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:22:24,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:24,076 INFO ]: With dead ends: 535 [2018-06-22 11:22:24,076 INFO ]: Without dead ends: 535 [2018-06-22 11:22:24,076 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:22:24,076 INFO ]: Start minimizeSevpa. Operand 535 states. [2018-06-22 11:22:24,115 INFO ]: Finished minimizeSevpa. Reduced states from 535 to 395. [2018-06-22 11:22:24,115 INFO ]: Start removeUnreachable. Operand 395 states. [2018-06-22 11:22:24,117 INFO ]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1164 transitions. [2018-06-22 11:22:24,117 INFO ]: Start accepts. Automaton has 395 states and 1164 transitions. Word has length 29 [2018-06-22 11:22:24,117 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:24,117 INFO ]: Abstraction has 395 states and 1164 transitions. [2018-06-22 11:22:24,117 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:22:24,118 INFO ]: Start isEmpty. Operand 395 states and 1164 transitions. [2018-06-22 11:22:24,121 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:24,121 INFO ]: Found error trace [2018-06-22 11:22:24,121 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:24,121 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:24,122 INFO ]: Analyzing trace with hash -767844811, now seen corresponding path program 2 times [2018-06-22 11:22:24,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:24,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:24,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:24,122 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:24,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:24,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:24,230 INFO ]: Checked inductivity of 46 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:22:24,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:24,230 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:24,235 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:24,251 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:24,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:24,253 INFO ]: Computing forward predicates... [2018-06-22 11:22:24,396 INFO ]: Checked inductivity of 46 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:22:24,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:24,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:22:24,415 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:22:24,416 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:22:24,416 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:24,416 INFO ]: Start difference. First operand 395 states and 1164 transitions. Second operand 16 states. [2018-06-22 11:22:25,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:25,183 INFO ]: Finished difference Result 547 states and 1552 transitions. [2018-06-22 11:22:25,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:22:25,248 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:22:25,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:25,252 INFO ]: With dead ends: 547 [2018-06-22 11:22:25,252 INFO ]: Without dead ends: 547 [2018-06-22 11:22:25,252 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:22:25,252 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-22 11:22:25,280 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 453. [2018-06-22 11:22:25,280 INFO ]: Start removeUnreachable. Operand 453 states. [2018-06-22 11:22:25,283 INFO ]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1257 transitions. [2018-06-22 11:22:25,283 INFO ]: Start accepts. Automaton has 453 states and 1257 transitions. Word has length 29 [2018-06-22 11:22:25,283 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:25,283 INFO ]: Abstraction has 453 states and 1257 transitions. [2018-06-22 11:22:25,283 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:22:25,283 INFO ]: Start isEmpty. Operand 453 states and 1257 transitions. [2018-06-22 11:22:25,289 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:25,290 INFO ]: Found error trace [2018-06-22 11:22:25,290 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:25,290 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:25,290 INFO ]: Analyzing trace with hash -1339185254, now seen corresponding path program 2 times [2018-06-22 11:22:25,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:25,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:25,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:25,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:25,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:25,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:25,388 INFO ]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:22:25,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:25,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:25,394 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:25,410 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:25,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:25,412 INFO ]: Computing forward predicates... [2018-06-22 11:22:25,480 INFO ]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:22:25,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:25,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:22:25,498 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:22:25,498 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:22:25,498 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:25,498 INFO ]: Start difference. First operand 453 states and 1257 transitions. Second operand 16 states. Received shutdown request... [2018-06-22 11:22:25,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:22:25,740 WARN ]: Verification canceled [2018-06-22 11:22:25,744 WARN ]: Timeout [2018-06-22 11:22:25,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:22:25 BoogieIcfgContainer [2018-06-22 11:22:25,744 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:22:25,745 INFO ]: Toolchain (without parser) took 55224.62 ms. Allocated memory was 308.8 MB in the beginning and 796.4 MB in the end (delta: 487.6 MB). Free memory was 261.2 MB in the beginning and 426.6 MB in the end (delta: -165.4 MB). Peak memory consumption was 322.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:22:25,745 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:22:25,746 INFO ]: ChcToBoogie took 60.70 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:22:25,746 INFO ]: Boogie Preprocessor took 59.90 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:22:25,746 INFO ]: RCFGBuilder took 645.98 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 240.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:22:25,746 INFO ]: TraceAbstraction took 54449.30 ms. Allocated memory was 308.8 MB in the beginning and 796.4 MB in the end (delta: 487.6 MB). Free memory was 240.2 MB in the beginning and 426.6 MB in the end (delta: -186.4 MB). Peak memory consumption was 301.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:22:25,748 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.70 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.90 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 645.98 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 240.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54449.30 ms. Allocated memory was 308.8 MB in the beginning and 796.4 MB in the end (delta: 487.6 MB). Free memory was 240.2 MB in the beginning and 426.6 MB in the end (delta: -186.4 MB). Peak memory consumption was 301.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (453states) and interpolant automaton (currently 12 states, 16 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. TIMEOUT Result, 54.3s OverallTime, 48 OverallIterations, 6 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3278 SDtfs, 635 SDslu, 18896 SDs, 0 SdLazy, 24317 SolverSat, 4207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1791 GetRequests, 805 SyntacticMatches, 5 SemanticMatches, 980 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 47 MinimizatonAttempts, 2054 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 1834 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 1748 ConstructedInterpolants, 22 QuantifiedInterpolants, 163456 SizeOfPredicates, 320 NumberOfNonLiveVariables, 4510 ConjunctsInSsa, 713 ConjunctsInUnsatCore, 86 InterpolantComputations, 10 PerfectInterpolantSequences, 901/1715 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-22-25-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-22-25-757.csv Completed graceful shutdown