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/008b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:11:25,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:11:25,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:11:25,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:11:25,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:11:25,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:11:25,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:11:25,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:11:25,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:11:25,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:11:25,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:11:25,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:11:25,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:11:25,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:11:25,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:11:25,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:11:25,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:11:25,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:11:25,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:11:25,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:11:25,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:11:25,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:11:25,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:11:25,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:11:25,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:11:25,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:11:25,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:11:25,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:11:25,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:11:25,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:11:25,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:11:25,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:11:25,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:11:25,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:11:25,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:11:25,081 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:11:25,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:11:25,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:11:25,098 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:11:25,098 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:11:25,099 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:11:25,099 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:11:25,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:11:25,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:11:25,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:11:25,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:11:25,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:11:25,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:11:25,100 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:11:25,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:11:25,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:11:25,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:11:25,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:11:25,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:11:25,102 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:11:25,105 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:11:25,106 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:11:25,158 INFO ]: Repository-Root is: /tmp [2018-06-22 11:11:25,172 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:11:25,178 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:11:25,179 INFO ]: Initializing SmtParser... [2018-06-22 11:11:25,180 INFO ]: SmtParser initialized [2018-06-22 11:11:25,180 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-22 11:11:25,182 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:11:25,282 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 unknown [2018-06-22 11:11:25,541 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-22 11:11:25,555 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:11:25,571 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:11:25,571 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:11:25,571 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:11:25,571 INFO ]: ChcToBoogie initialized [2018-06-22 11:11:25,575 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25 Unit [2018-06-22 11:11:25,620 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:11:25,620 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:11:25,620 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:11:25,620 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:11:25,640 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,640 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,648 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,649 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,664 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,666 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,667 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,669 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:11:25,679 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:11:25,679 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:11:25,679 INFO ]: RCFGBuilder initialized [2018-06-22 11:11:25,680 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (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:11:25,699 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:11:25,699 INFO ]: Found specification of procedure False [2018-06-22 11:11:25,699 INFO ]: Found implementation of procedure False [2018-06-22 11:11:25,699 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:11:25,699 INFO ]: Found specification of procedure INV1 [2018-06-22 11:11:25,699 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:11:25,699 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:11:25,699 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:11:25,699 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:11:26,106 INFO ]: Using library mode [2018-06-22 11:11:26,106 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:11:26 BoogieIcfgContainer [2018-06-22 11:11:26,106 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:11:26,114 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:11:26,114 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:11:26,117 INFO ]: TraceAbstraction initialized [2018-06-22 11:11:26,117 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:11:25" (1/3) ... [2018-06-22 11:11:26,118 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631ffe6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:11:26, skipping insertion in model container [2018-06-22 11:11:26,118 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (2/3) ... [2018-06-22 11:11:26,119 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631ffe6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:11:26, skipping insertion in model container [2018-06-22 11:11:26,119 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:11:26" (3/3) ... [2018-06-22 11:11:26,121 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:11:26,132 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:11:26,141 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:11:26,200 INFO ]: Using default assertion order modulation [2018-06-22 11:11:26,201 INFO ]: Interprodecural is true [2018-06-22 11:11:26,201 INFO ]: Hoare is false [2018-06-22 11:11:26,201 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:11:26,201 INFO ]: Backedges is TWOTRACK [2018-06-22 11:11:26,201 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:11:26,201 INFO ]: Difference is false [2018-06-22 11:11:26,201 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:11:26,201 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:11:26,230 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:11:26,245 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:11:26,245 INFO ]: Found error trace [2018-06-22 11:11:26,246 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:26,246 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:26,250 INFO ]: Analyzing trace with hash -68818489, now seen corresponding path program 1 times [2018-06-22 11:11:26,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:26,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:26,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:26,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:26,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:26,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:26,462 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:11:26,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:26,465 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:26,467 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:26,480 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:26,481 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:26,483 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-22 11:11:26,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:26,975 INFO ]: Finished difference Result 23 states and 54 transitions. [2018-06-22 11:11:26,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:26,977 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:11:26,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:26,995 INFO ]: With dead ends: 23 [2018-06-22 11:11:26,995 INFO ]: Without dead ends: 23 [2018-06-22 11:11:26,999 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:11:27,020 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:11:27,070 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:11:27,072 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:11:27,075 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2018-06-22 11:11:27,076 INFO ]: Start accepts. Automaton has 23 states and 54 transitions. Word has length 9 [2018-06-22 11:11:27,081 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:27,081 INFO ]: Abstraction has 23 states and 54 transitions. [2018-06-22 11:11:27,081 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:27,081 INFO ]: Start isEmpty. Operand 23 states and 54 transitions. [2018-06-22 11:11:27,091 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:27,091 INFO ]: Found error trace [2018-06-22 11:11:27,091 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:27,091 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:27,091 INFO ]: Analyzing trace with hash -326642065, now seen corresponding path program 1 times [2018-06-22 11:11:27,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:27,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:27,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:27,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:27,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:27,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:27,247 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:11:27,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:27,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:27,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:27,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:27,307 INFO ]: Computing forward predicates... [2018-06-22 11:11:27,681 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:11:27,716 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:11:27,716 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:11:27,717 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:11:27,717 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:11:27,717 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:11:27,717 INFO ]: Start difference. First operand 23 states and 54 transitions. Second operand 8 states. [2018-06-22 11:11:29,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:29,436 INFO ]: Finished difference Result 40 states and 145 transitions. [2018-06-22 11:11:29,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:11:29,437 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:11:29,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:29,441 INFO ]: With dead ends: 40 [2018-06-22 11:11:29,441 INFO ]: Without dead ends: 40 [2018-06-22 11:11:29,442 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:29,442 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:11:29,486 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:11:29,486 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:11:29,488 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2018-06-22 11:11:29,488 INFO ]: Start accepts. Automaton has 34 states and 98 transitions. Word has length 13 [2018-06-22 11:11:29,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:29,488 INFO ]: Abstraction has 34 states and 98 transitions. [2018-06-22 11:11:29,488 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:11:29,488 INFO ]: Start isEmpty. Operand 34 states and 98 transitions. [2018-06-22 11:11:29,500 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:29,500 INFO ]: Found error trace [2018-06-22 11:11:29,500 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:29,500 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:29,501 INFO ]: Analyzing trace with hash 949913661, now seen corresponding path program 1 times [2018-06-22 11:11:29,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:29,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:29,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:29,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:29,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:29,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:29,632 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:11:29,632 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:29,632 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:11:29,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:29,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:29,666 INFO ]: Computing forward predicates... [2018-06-22 11:11:29,789 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:11:29,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:29,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:11:29,813 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:11:29,813 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:11:29,813 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:29,813 INFO ]: Start difference. First operand 34 states and 98 transitions. Second operand 9 states. [2018-06-22 11:11:30,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:30,257 INFO ]: Finished difference Result 54 states and 207 transitions. [2018-06-22 11:11:30,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:11:30,257 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:11:30,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:30,261 INFO ]: With dead ends: 54 [2018-06-22 11:11:30,261 INFO ]: Without dead ends: 54 [2018-06-22 11:11:30,262 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:30,262 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:11:30,287 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-06-22 11:11:30,287 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:11:30,289 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 159 transitions. [2018-06-22 11:11:30,289 INFO ]: Start accepts. Automaton has 42 states and 159 transitions. Word has length 13 [2018-06-22 11:11:30,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:30,289 INFO ]: Abstraction has 42 states and 159 transitions. [2018-06-22 11:11:30,289 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:11:30,289 INFO ]: Start isEmpty. Operand 42 states and 159 transitions. [2018-06-22 11:11:30,292 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:30,292 INFO ]: Found error trace [2018-06-22 11:11:30,292 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:30,292 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:30,293 INFO ]: Analyzing trace with hash -2043398036, now seen corresponding path program 1 times [2018-06-22 11:11:30,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:30,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:30,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:30,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:30,350 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:11:30,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:30,351 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:11:30,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:30,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:30,379 INFO ]: Computing forward predicates... [2018-06-22 11:11:30,415 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:11:30,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:30,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:11:30,435 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:11:30,435 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:11:30,435 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:11:30,435 INFO ]: Start difference. First operand 42 states and 159 transitions. Second operand 8 states. [2018-06-22 11:11:30,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:30,886 INFO ]: Finished difference Result 50 states and 212 transitions. [2018-06-22 11:11:30,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:11:30,886 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:11:30,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:30,888 INFO ]: With dead ends: 50 [2018-06-22 11:11:30,888 INFO ]: Without dead ends: 50 [2018-06-22 11:11:30,889 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:30,889 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:11:30,924 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-22 11:11:30,924 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:11:30,928 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 158 transitions. [2018-06-22 11:11:30,928 INFO ]: Start accepts. Automaton has 42 states and 158 transitions. Word has length 13 [2018-06-22 11:11:30,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:30,929 INFO ]: Abstraction has 42 states and 158 transitions. [2018-06-22 11:11:30,929 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:11:30,929 INFO ]: Start isEmpty. Operand 42 states and 158 transitions. [2018-06-22 11:11:30,931 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:30,931 INFO ]: Found error trace [2018-06-22 11:11:30,931 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:30,931 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:30,932 INFO ]: Analyzing trace with hash -571892918, now seen corresponding path program 1 times [2018-06-22 11:11:30,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:30,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:30,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:30,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,007 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:11:31,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:31,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:31,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:31,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,026 INFO ]: Computing forward predicates... [2018-06-22 11:11:31,096 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:11:31,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:31,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:11:31,120 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:31,120 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:31,120 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:31,120 INFO ]: Start difference. First operand 42 states and 158 transitions. Second operand 10 states. [2018-06-22 11:11:31,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:31,522 INFO ]: Finished difference Result 58 states and 261 transitions. [2018-06-22 11:11:31,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:11:31,523 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:11:31,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:31,526 INFO ]: With dead ends: 58 [2018-06-22 11:11:31,526 INFO ]: Without dead ends: 58 [2018-06-22 11:11:31,526 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:31,526 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:11:31,557 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 11:11:31,557 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:11:31,560 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 257 transitions. [2018-06-22 11:11:31,560 INFO ]: Start accepts. Automaton has 56 states and 257 transitions. Word has length 13 [2018-06-22 11:11:31,560 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:31,560 INFO ]: Abstraction has 56 states and 257 transitions. [2018-06-22 11:11:31,560 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:31,560 INFO ]: Start isEmpty. Operand 56 states and 257 transitions. [2018-06-22 11:11:31,563 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:31,563 INFO ]: Found error trace [2018-06-22 11:11:31,563 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:31,563 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:31,563 INFO ]: Analyzing trace with hash 704662808, now seen corresponding path program 1 times [2018-06-22 11:11:31,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:31,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:31,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:31,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:31,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:31,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,650 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:11:31,650 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:31,650 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:11:31,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:31,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,676 INFO ]: Computing forward predicates... [2018-06-22 11:11:31,697 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:11:31,718 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:11:31,718 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:11:31,718 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:11:31,718 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:11:31,718 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:11:31,718 INFO ]: Start difference. First operand 56 states and 257 transitions. Second operand 8 states. [2018-06-22 11:11:32,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:32,128 INFO ]: Finished difference Result 66 states and 326 transitions. [2018-06-22 11:11:32,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:11:32,128 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:11:32,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:32,131 INFO ]: With dead ends: 66 [2018-06-22 11:11:32,131 INFO ]: Without dead ends: 66 [2018-06-22 11:11:32,131 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:32,131 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:11:32,154 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-06-22 11:11:32,154 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:11:32,156 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 295 transitions. [2018-06-22 11:11:32,157 INFO ]: Start accepts. Automaton has 62 states and 295 transitions. Word has length 13 [2018-06-22 11:11:32,157 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:32,157 INFO ]: Abstraction has 62 states and 295 transitions. [2018-06-22 11:11:32,157 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:11:32,157 INFO ]: Start isEmpty. Operand 62 states and 295 transitions. [2018-06-22 11:11:32,160 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:32,160 INFO ]: Found error trace [2018-06-22 11:11:32,160 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:32,160 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:32,161 INFO ]: Analyzing trace with hash -1552896330, now seen corresponding path program 1 times [2018-06-22 11:11:32,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:32,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:32,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:32,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:32,267 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:11:32,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:32,267 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) [2018-06-22 11:11:32,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:32,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:32,306 INFO ]: Computing forward predicates... [2018-06-22 11:11:32,455 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:11:32,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:32,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:11:32,475 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:32,475 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:32,475 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:32,475 INFO ]: Start difference. First operand 62 states and 295 transitions. Second operand 10 states. [2018-06-22 11:11:32,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:32,883 INFO ]: Finished difference Result 80 states and 399 transitions. [2018-06-22 11:11:32,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:11:32,884 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:11:32,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:32,888 INFO ]: With dead ends: 80 [2018-06-22 11:11:32,888 INFO ]: Without dead ends: 80 [2018-06-22 11:11:32,888 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:32,888 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:11:32,921 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 62. [2018-06-22 11:11:32,921 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:11:32,924 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 295 transitions. [2018-06-22 11:11:32,924 INFO ]: Start accepts. Automaton has 62 states and 295 transitions. Word has length 13 [2018-06-22 11:11:32,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:32,924 INFO ]: Abstraction has 62 states and 295 transitions. [2018-06-22 11:11:32,924 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:32,925 INFO ]: Start isEmpty. Operand 62 states and 295 transitions. [2018-06-22 11:11:32,932 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:32,932 INFO ]: Found error trace [2018-06-22 11:11:32,933 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:32,933 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:32,933 INFO ]: Analyzing trace with hash 470670144, now seen corresponding path program 1 times [2018-06-22 11:11:32,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:32,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:32,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:32,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:33,126 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:11:33,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:33,127 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:33,127 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:33,127 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:33,127 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:33,127 INFO ]: Start difference. First operand 62 states and 295 transitions. Second operand 4 states. [2018-06-22 11:11:34,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:34,085 INFO ]: Finished difference Result 126 states and 677 transitions. [2018-06-22 11:11:34,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:34,085 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:34,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:34,089 INFO ]: With dead ends: 126 [2018-06-22 11:11:34,089 INFO ]: Without dead ends: 126 [2018-06-22 11:11:34,090 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:11:34,090 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 11:11:34,131 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-06-22 11:11:34,131 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 11:11:34,134 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 570 transitions. [2018-06-22 11:11:34,134 INFO ]: Start accepts. Automaton has 110 states and 570 transitions. Word has length 17 [2018-06-22 11:11:34,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:34,134 INFO ]: Abstraction has 110 states and 570 transitions. [2018-06-22 11:11:34,134 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:34,134 INFO ]: Start isEmpty. Operand 110 states and 570 transitions. [2018-06-22 11:11:34,140 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:34,140 INFO ]: Found error trace [2018-06-22 11:11:34,140 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:34,140 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:34,140 INFO ]: Analyzing trace with hash -111417775, now seen corresponding path program 1 times [2018-06-22 11:11:34,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:34,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:34,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:34,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:34,303 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:34,303 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:34,303 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:11:34,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:34,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:34,327 INFO ]: Computing forward predicates... [2018-06-22 11:11:34,402 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:11:34,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:34,425 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-06-22 11:11:34,425 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:34,426 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:34,426 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:34,426 INFO ]: Start difference. First operand 110 states and 570 transitions. Second operand 11 states. [2018-06-22 11:11:36,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:36,021 INFO ]: Finished difference Result 234 states and 944 transitions. [2018-06-22 11:11:36,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:11:36,021 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:11:36,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:36,025 INFO ]: With dead ends: 234 [2018-06-22 11:11:36,026 INFO ]: Without dead ends: 229 [2018-06-22 11:11:36,026 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:36,026 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-22 11:11:36,095 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 161. [2018-06-22 11:11:36,095 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-22 11:11:36,100 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 698 transitions. [2018-06-22 11:11:36,100 INFO ]: Start accepts. Automaton has 161 states and 698 transitions. Word has length 17 [2018-06-22 11:11:36,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:36,101 INFO ]: Abstraction has 161 states and 698 transitions. [2018-06-22 11:11:36,101 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:36,101 INFO ]: Start isEmpty. Operand 161 states and 698 transitions. [2018-06-22 11:11:36,109 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:36,110 INFO ]: Found error trace [2018-06-22 11:11:36,110 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:36,110 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:36,110 INFO ]: Analyzing trace with hash 17651726, now seen corresponding path program 1 times [2018-06-22 11:11:36,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:36,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:36,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:36,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:36,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:36,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:36,270 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:11:36,271 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:36,271 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:36,271 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:36,271 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:36,271 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:36,271 INFO ]: Start difference. First operand 161 states and 698 transitions. Second operand 4 states. [2018-06-22 11:11:37,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:37,507 INFO ]: Finished difference Result 193 states and 833 transitions. [2018-06-22 11:11:37,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:37,510 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:37,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:37,514 INFO ]: With dead ends: 193 [2018-06-22 11:11:37,514 INFO ]: Without dead ends: 179 [2018-06-22 11:11:37,514 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:11:37,514 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 11:11:37,560 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 165. [2018-06-22 11:11:37,560 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-22 11:11:37,563 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 686 transitions. [2018-06-22 11:11:37,563 INFO ]: Start accepts. Automaton has 165 states and 686 transitions. Word has length 17 [2018-06-22 11:11:37,563 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:37,563 INFO ]: Abstraction has 165 states and 686 transitions. [2018-06-22 11:11:37,563 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:37,563 INFO ]: Start isEmpty. Operand 165 states and 686 transitions. [2018-06-22 11:11:37,570 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:37,570 INFO ]: Found error trace [2018-06-22 11:11:37,570 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:37,570 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:37,570 INFO ]: Analyzing trace with hash 1555238015, now seen corresponding path program 1 times [2018-06-22 11:11:37,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:37,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:37,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:37,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:37,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:37,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:37,743 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:11:37,744 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:37,744 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:37,744 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:37,744 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:37,744 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:37,744 INFO ]: Start difference. First operand 165 states and 686 transitions. Second operand 4 states. [2018-06-22 11:11:38,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:38,774 INFO ]: Finished difference Result 197 states and 620 transitions. [2018-06-22 11:11:38,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:38,774 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:38,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:38,778 INFO ]: With dead ends: 197 [2018-06-22 11:11:38,778 INFO ]: Without dead ends: 170 [2018-06-22 11:11:38,778 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:11:38,778 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 11:11:38,813 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 144. [2018-06-22 11:11:38,813 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 11:11:38,815 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 480 transitions. [2018-06-22 11:11:38,815 INFO ]: Start accepts. Automaton has 144 states and 480 transitions. Word has length 17 [2018-06-22 11:11:38,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:38,815 INFO ]: Abstraction has 144 states and 480 transitions. [2018-06-22 11:11:38,815 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:38,815 INFO ]: Start isEmpty. Operand 144 states and 480 transitions. [2018-06-22 11:11:38,818 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:38,818 INFO ]: Found error trace [2018-06-22 11:11:38,818 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:38,819 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:38,819 INFO ]: Analyzing trace with hash 2016307742, now seen corresponding path program 1 times [2018-06-22 11:11:38,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:38,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:38,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:38,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:39,068 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:11:39,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:39,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:39,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:39,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:39,089 INFO ]: Computing forward predicates... [2018-06-22 11:11:39,199 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:11:39,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:39,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:11:39,220 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:11:39,220 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:11:39,220 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:39,221 INFO ]: Start difference. First operand 144 states and 480 transitions. Second operand 13 states. [2018-06-22 11:11:39,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:39,854 INFO ]: Finished difference Result 220 states and 751 transitions. [2018-06-22 11:11:39,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:39,854 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:11:39,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:39,858 INFO ]: With dead ends: 220 [2018-06-22 11:11:39,858 INFO ]: Without dead ends: 212 [2018-06-22 11:11:39,858 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:11:39,858 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-22 11:11:39,892 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 144. [2018-06-22 11:11:39,892 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 11:11:39,895 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 497 transitions. [2018-06-22 11:11:39,895 INFO ]: Start accepts. Automaton has 144 states and 497 transitions. Word has length 17 [2018-06-22 11:11:39,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:39,895 INFO ]: Abstraction has 144 states and 497 transitions. [2018-06-22 11:11:39,895 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:11:39,895 INFO ]: Start isEmpty. Operand 144 states and 497 transitions. [2018-06-22 11:11:39,899 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:39,899 INFO ]: Found error trace [2018-06-22 11:11:39,899 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:39,899 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:39,899 INFO ]: Analyzing trace with hash -612003764, now seen corresponding path program 1 times [2018-06-22 11:11:39,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:39,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:39,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:39,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:39,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:39,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:39,957 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:11:39,957 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:39,957 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:39,957 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:39,957 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:39,957 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:39,957 INFO ]: Start difference. First operand 144 states and 497 transitions. Second operand 4 states. [2018-06-22 11:11:40,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:40,364 INFO ]: Finished difference Result 148 states and 363 transitions. [2018-06-22 11:11:40,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:40,364 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:40,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:40,366 INFO ]: With dead ends: 148 [2018-06-22 11:11:40,366 INFO ]: Without dead ends: 134 [2018-06-22 11:11:40,366 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:11:40,367 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:11:40,381 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-06-22 11:11:40,381 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:11:40,382 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 281 transitions. [2018-06-22 11:11:40,383 INFO ]: Start accepts. Automaton has 116 states and 281 transitions. Word has length 17 [2018-06-22 11:11:40,383 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:40,383 INFO ]: Abstraction has 116 states and 281 transitions. [2018-06-22 11:11:40,383 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:40,383 INFO ]: Start isEmpty. Operand 116 states and 281 transitions. [2018-06-22 11:11:40,386 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:40,386 INFO ]: Found error trace [2018-06-22 11:11:40,386 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:40,386 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:40,386 INFO ]: Analyzing trace with hash -130133366, now seen corresponding path program 1 times [2018-06-22 11:11:40,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:40,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:40,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:40,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,091 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:11:41,091 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:41,091 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:11:41,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:41,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,113 INFO ]: Computing forward predicates... [2018-06-22 11:11:41,244 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:11:41,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:41,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:11:41,265 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:41,266 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:41,266 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:41,266 INFO ]: Start difference. First operand 116 states and 281 transitions. Second operand 11 states. [2018-06-22 11:11:41,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:41,595 INFO ]: Finished difference Result 164 states and 404 transitions. [2018-06-22 11:11:41,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:11:41,596 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:11:41,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:41,598 INFO ]: With dead ends: 164 [2018-06-22 11:11:41,598 INFO ]: Without dead ends: 164 [2018-06-22 11:11:41,598 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:41,598 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 11:11:41,611 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 126. [2018-06-22 11:11:41,611 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 11:11:41,613 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 304 transitions. [2018-06-22 11:11:41,613 INFO ]: Start accepts. Automaton has 126 states and 304 transitions. Word has length 17 [2018-06-22 11:11:41,613 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:41,613 INFO ]: Abstraction has 126 states and 304 transitions. [2018-06-22 11:11:41,613 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:41,613 INFO ]: Start isEmpty. Operand 126 states and 304 transitions. [2018-06-22 11:11:41,618 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:41,618 INFO ]: Found error trace [2018-06-22 11:11:41,618 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:41,618 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:41,619 INFO ]: Analyzing trace with hash -766956315, now seen corresponding path program 1 times [2018-06-22 11:11:41,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:41,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:41,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:41,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:41,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:41,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,734 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:11:41,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:41,734 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:41,734 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:41,735 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:41,735 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:41,735 INFO ]: Start difference. First operand 126 states and 304 transitions. Second operand 4 states. [2018-06-22 11:11:42,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:42,012 INFO ]: Finished difference Result 137 states and 307 transitions. [2018-06-22 11:11:42,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:42,012 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:42,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:42,014 INFO ]: With dead ends: 137 [2018-06-22 11:11:42,014 INFO ]: Without dead ends: 110 [2018-06-22 11:11:42,015 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:11:42,015 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:11:42,029 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 98. [2018-06-22 11:11:42,029 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 11:11:42,030 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 220 transitions. [2018-06-22 11:11:42,030 INFO ]: Start accepts. Automaton has 98 states and 220 transitions. Word has length 17 [2018-06-22 11:11:42,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:42,030 INFO ]: Abstraction has 98 states and 220 transitions. [2018-06-22 11:11:42,030 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:42,030 INFO ]: Start isEmpty. Operand 98 states and 220 transitions. [2018-06-22 11:11:42,034 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:42,034 INFO ]: Found error trace [2018-06-22 11:11:42,035 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:42,035 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:42,035 INFO ]: Analyzing trace with hash 567557297, now seen corresponding path program 1 times [2018-06-22 11:11:42,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:42,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:42,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:42,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:42,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:42,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:42,248 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:42,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:42,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:42,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:42,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:42,268 INFO ]: Computing forward predicates... [2018-06-22 11:11:42,331 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:11:42,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:42,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:11:42,352 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:11:42,352 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:11:42,352 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:11:42,352 INFO ]: Start difference. First operand 98 states and 220 transitions. Second operand 12 states. [2018-06-22 11:11:43,158 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 11:11:44,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:44,471 INFO ]: Finished difference Result 124 states and 259 transitions. [2018-06-22 11:11:44,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:44,473 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:11:44,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:44,474 INFO ]: With dead ends: 124 [2018-06-22 11:11:44,474 INFO ]: Without dead ends: 124 [2018-06-22 11:11:44,475 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:44,475 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 11:11:44,482 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 100. [2018-06-22 11:11:44,483 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:11:44,484 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 226 transitions. [2018-06-22 11:11:44,484 INFO ]: Start accepts. Automaton has 100 states and 226 transitions. Word has length 17 [2018-06-22 11:11:44,484 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:44,484 INFO ]: Abstraction has 100 states and 226 transitions. [2018-06-22 11:11:44,484 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:11:44,484 INFO ]: Start isEmpty. Operand 100 states and 226 transitions. [2018-06-22 11:11:44,486 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:44,486 INFO ]: Found error trace [2018-06-22 11:11:44,487 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:44,487 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:44,487 INFO ]: Analyzing trace with hash 1897900749, now seen corresponding path program 1 times [2018-06-22 11:11:44,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:44,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:44,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:44,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:44,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:44,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:44,752 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:11:44,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:44,753 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:11:44,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:44,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:44,775 INFO ]: Computing forward predicates... [2018-06-22 11:11:44,868 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:11:44,905 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:44,905 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:11:44,906 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:44,906 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:44,906 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:44,906 INFO ]: Start difference. First operand 100 states and 226 transitions. Second operand 10 states. [2018-06-22 11:11:45,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:45,215 INFO ]: Finished difference Result 95 states and 202 transitions. [2018-06-22 11:11:45,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:11:45,218 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:11:45,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:45,219 INFO ]: With dead ends: 95 [2018-06-22 11:11:45,219 INFO ]: Without dead ends: 69 [2018-06-22 11:11:45,220 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:45,220 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:11:45,226 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-06-22 11:11:45,226 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:11:45,226 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 128 transitions. [2018-06-22 11:11:45,227 INFO ]: Start accepts. Automaton has 65 states and 128 transitions. Word has length 17 [2018-06-22 11:11:45,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:45,227 INFO ]: Abstraction has 65 states and 128 transitions. [2018-06-22 11:11:45,227 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:45,227 INFO ]: Start isEmpty. Operand 65 states and 128 transitions. [2018-06-22 11:11:45,228 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:45,228 INFO ]: Found error trace [2018-06-22 11:11:45,228 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:45,228 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:45,228 INFO ]: Analyzing trace with hash 114538879, now seen corresponding path program 2 times [2018-06-22 11:11:45,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:45,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:45,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:45,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:45,322 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:11:45,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:45,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:45,330 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:45,376 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:45,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:45,379 INFO ]: Computing forward predicates... [2018-06-22 11:11:45,583 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:11:45,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:45,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:11:45,617 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:11:45,617 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:11:45,617 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:45,617 INFO ]: Start difference. First operand 65 states and 128 transitions. Second operand 14 states. [2018-06-22 11:11:46,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:46,063 INFO ]: Finished difference Result 105 states and 215 transitions. [2018-06-22 11:11:46,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:46,063 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:11:46,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:46,064 INFO ]: With dead ends: 105 [2018-06-22 11:11:46,064 INFO ]: Without dead ends: 105 [2018-06-22 11:11:46,065 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:11:46,065 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:11:46,071 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-06-22 11:11:46,071 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:11:46,072 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 176 transitions. [2018-06-22 11:11:46,072 INFO ]: Start accepts. Automaton has 85 states and 176 transitions. Word has length 17 [2018-06-22 11:11:46,072 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:46,072 INFO ]: Abstraction has 85 states and 176 transitions. [2018-06-22 11:11:46,072 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:11:46,072 INFO ]: Start isEmpty. Operand 85 states and 176 transitions. [2018-06-22 11:11:46,073 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:46,073 INFO ]: Found error trace [2018-06-22 11:11:46,074 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:46,074 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:46,074 INFO ]: Analyzing trace with hash 1352165338, now seen corresponding path program 1 times [2018-06-22 11:11:46,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:46,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:46,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:46,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,081 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,206 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:11:46,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:46,206 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:11:46,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:46,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,241 INFO ]: Computing forward predicates... [2018-06-22 11:11:46,746 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:11:46,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:46,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:11:46,777 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:11:46,777 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:11:46,777 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:46,777 INFO ]: Start difference. First operand 85 states and 176 transitions. Second operand 13 states. [2018-06-22 11:11:46,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:46,951 INFO ]: Finished difference Result 107 states and 207 transitions. [2018-06-22 11:11:46,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:11:46,951 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:11:46,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:46,952 INFO ]: With dead ends: 107 [2018-06-22 11:11:46,952 INFO ]: Without dead ends: 107 [2018-06-22 11:11:46,952 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:46,952 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:11:46,962 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 89. [2018-06-22 11:11:46,963 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:11:46,964 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 180 transitions. [2018-06-22 11:11:46,964 INFO ]: Start accepts. Automaton has 89 states and 180 transitions. Word has length 17 [2018-06-22 11:11:46,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:46,964 INFO ]: Abstraction has 89 states and 180 transitions. [2018-06-22 11:11:46,964 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:11:46,964 INFO ]: Start isEmpty. Operand 89 states and 180 transitions. [2018-06-22 11:11:46,965 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:46,965 INFO ]: Found error trace [2018-06-22 11:11:46,965 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:46,965 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:46,965 INFO ]: Analyzing trace with hash 1424528104, now seen corresponding path program 1 times [2018-06-22 11:11:46,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:46,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:46,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:46,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:47,125 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:11:47,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:47,125 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) [2018-06-22 11:11:47,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:47,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:47,177 INFO ]: Computing forward predicates... [2018-06-22 11:11:47,268 INFO ]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:11:47,301 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:11:47,301 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:11:47,301 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:47,301 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:47,301 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:47,302 INFO ]: Start difference. First operand 89 states and 180 transitions. Second operand 4 states. [2018-06-22 11:11:48,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:48,147 INFO ]: Finished difference Result 83 states and 157 transitions. [2018-06-22 11:11:48,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:48,147 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:11:48,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:48,148 INFO ]: With dead ends: 83 [2018-06-22 11:11:48,148 INFO ]: Without dead ends: 83 [2018-06-22 11:11:48,148 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 1 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:11:48,149 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:11:48,154 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-06-22 11:11:48,154 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:11:48,155 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 157 transitions. [2018-06-22 11:11:48,155 INFO ]: Start accepts. Automaton has 83 states and 157 transitions. Word has length 21 [2018-06-22 11:11:48,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:48,155 INFO ]: Abstraction has 83 states and 157 transitions. [2018-06-22 11:11:48,155 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:48,155 INFO ]: Start isEmpty. Operand 83 states and 157 transitions. [2018-06-22 11:11:48,156 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:48,157 INFO ]: Found error trace [2018-06-22 11:11:48,157 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:48,157 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:48,157 INFO ]: Analyzing trace with hash -1186781936, now seen corresponding path program 2 times [2018-06-22 11:11:48,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:48,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:48,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:48,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:48,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:48,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:48,277 INFO ]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:11:48,277 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:48,277 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:11:48,283 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:48,299 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:48,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:48,301 INFO ]: Computing forward predicates... [2018-06-22 11:11:48,372 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:11:48,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:48,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2018-06-22 11:11:48,404 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:48,404 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:48,404 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:48,405 INFO ]: Start difference. First operand 83 states and 157 transitions. Second operand 11 states. [2018-06-22 11:11:48,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:48,629 INFO ]: Finished difference Result 113 states and 214 transitions. [2018-06-22 11:11:48,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:48,629 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:11:48,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:48,630 INFO ]: With dead ends: 113 [2018-06-22 11:11:48,630 INFO ]: Without dead ends: 111 [2018-06-22 11:11:48,630 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:48,630 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:11:48,636 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 77. [2018-06-22 11:11:48,636 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:11:48,637 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 140 transitions. [2018-06-22 11:11:48,637 INFO ]: Start accepts. Automaton has 77 states and 140 transitions. Word has length 21 [2018-06-22 11:11:48,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:48,637 INFO ]: Abstraction has 77 states and 140 transitions. [2018-06-22 11:11:48,637 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:48,637 INFO ]: Start isEmpty. Operand 77 states and 140 transitions. [2018-06-22 11:11:48,638 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:48,638 INFO ]: Found error trace [2018-06-22 11:11:48,638 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:48,638 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:48,638 INFO ]: Analyzing trace with hash -525249892, now seen corresponding path program 2 times [2018-06-22 11:11:48,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:48,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:48,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:48,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:48,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:48,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:48,761 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:11:48,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:48,762 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:11:48,767 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:48,788 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:48,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:48,790 INFO ]: Computing forward predicates... [2018-06-22 11:11:49,037 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:11:49,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:49,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:11:49,059 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:11:49,059 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:11:49,059 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:11:49,060 INFO ]: Start difference. First operand 77 states and 140 transitions. Second operand 17 states. [2018-06-22 11:11:49,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:49,576 INFO ]: Finished difference Result 87 states and 154 transitions. [2018-06-22 11:11:49,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:11:49,578 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:11:49,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:49,579 INFO ]: With dead ends: 87 [2018-06-22 11:11:49,579 INFO ]: Without dead ends: 87 [2018-06-22 11:11:49,579 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:11:49,579 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:11:49,584 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 75. [2018-06-22 11:11:49,584 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:11:49,585 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 138 transitions. [2018-06-22 11:11:49,585 INFO ]: Start accepts. Automaton has 75 states and 138 transitions. Word has length 21 [2018-06-22 11:11:49,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:49,585 INFO ]: Abstraction has 75 states and 138 transitions. [2018-06-22 11:11:49,585 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:11:49,585 INFO ]: Start isEmpty. Operand 75 states and 138 transitions. [2018-06-22 11:11:49,586 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:49,586 INFO ]: Found error trace [2018-06-22 11:11:49,586 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:49,586 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:49,586 INFO ]: Analyzing trace with hash 278925396, now seen corresponding path program 2 times [2018-06-22 11:11:49,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:49,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:49,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:49,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:49,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:49,592 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:49,797 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:11:49,797 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:49,797 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:11:49,803 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:49,821 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:49,821 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:49,822 INFO ]: Computing forward predicates... [2018-06-22 11:11:49,978 INFO ]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:11:49,998 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:49,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-06-22 11:11:49,998 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:11:49,999 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:11:49,999 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:49,999 INFO ]: Start difference. First operand 75 states and 138 transitions. Second operand 14 states. [2018-06-22 11:11:50,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:50,353 INFO ]: Finished difference Result 93 states and 158 transitions. [2018-06-22 11:11:50,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:50,353 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:11:50,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:50,354 INFO ]: With dead ends: 93 [2018-06-22 11:11:50,354 INFO ]: Without dead ends: 87 [2018-06-22 11:11:50,354 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:50,354 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:11:50,358 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 75. [2018-06-22 11:11:50,358 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:11:50,359 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 137 transitions. [2018-06-22 11:11:50,359 INFO ]: Start accepts. Automaton has 75 states and 137 transitions. Word has length 21 [2018-06-22 11:11:50,359 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:50,359 INFO ]: Abstraction has 75 states and 137 transitions. [2018-06-22 11:11:50,359 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:11:50,360 INFO ]: Start isEmpty. Operand 75 states and 137 transitions. [2018-06-22 11:11:50,361 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:50,361 INFO ]: Found error trace [2018-06-22 11:11:50,361 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:11:50,361 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:50,361 INFO ]: Analyzing trace with hash 1407235630, now seen corresponding path program 1 times [2018-06-22 11:11:50,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:50,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:50,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:50,362 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:50,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:50,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,889 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:11:50,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:50,889 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:11:50,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:50,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,910 INFO ]: Computing forward predicates... [2018-06-22 11:11:51,069 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:11:51,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:51,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 11:11:51,089 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:11:51,089 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:11:51,090 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:11:51,090 INFO ]: Start difference. First operand 75 states and 137 transitions. Second operand 16 states. [2018-06-22 11:11:51,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:51,936 INFO ]: Finished difference Result 129 states and 223 transitions. [2018-06-22 11:11:51,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:11:51,936 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:11:51,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:51,937 INFO ]: With dead ends: 129 [2018-06-22 11:11:51,937 INFO ]: Without dead ends: 129 [2018-06-22 11:11:51,937 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:11:51,938 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-22 11:11:51,943 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 77. [2018-06-22 11:11:51,943 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:11:51,944 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 139 transitions. [2018-06-22 11:11:51,944 INFO ]: Start accepts. Automaton has 77 states and 139 transitions. Word has length 21 [2018-06-22 11:11:51,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:51,944 INFO ]: Abstraction has 77 states and 139 transitions. [2018-06-22 11:11:51,944 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:11:51,944 INFO ]: Start isEmpty. Operand 77 states and 139 transitions. [2018-06-22 11:11:51,945 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:51,945 INFO ]: Found error trace [2018-06-22 11:11:51,945 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:51,945 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:51,945 INFO ]: Analyzing trace with hash -1535597754, now seen corresponding path program 2 times [2018-06-22 11:11:51,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:51,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:51,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:51,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:51,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:51,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:52,109 INFO ]: Checked inductivity of 33 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:52,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:52,109 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:11:52,115 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:52,132 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:52,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:52,134 INFO ]: Computing forward predicates... [2018-06-22 11:11:52,253 INFO ]: Checked inductivity of 33 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:52,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:52,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-06-22 11:11:52,275 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:11:52,275 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:11:52,275 INFO ]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:11:52,275 INFO ]: Start difference. First operand 77 states and 139 transitions. Second operand 16 states. [2018-06-22 11:11:52,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:52,562 INFO ]: Finished difference Result 93 states and 155 transitions. [2018-06-22 11:11:52,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:11:52,562 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:11:52,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:52,563 INFO ]: With dead ends: 93 [2018-06-22 11:11:52,563 INFO ]: Without dead ends: 85 [2018-06-22 11:11:52,563 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:52,563 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:11:52,567 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-06-22 11:11:52,567 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:11:52,568 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2018-06-22 11:11:52,568 INFO ]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 25 [2018-06-22 11:11:52,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:52,568 INFO ]: Abstraction has 77 states and 138 transitions. [2018-06-22 11:11:52,568 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:11:52,568 INFO ]: Start isEmpty. Operand 77 states and 138 transitions. [2018-06-22 11:11:52,569 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:52,569 INFO ]: Found error trace [2018-06-22 11:11:52,569 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:11:52,569 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:52,569 INFO ]: Analyzing trace with hash -1290757136, now seen corresponding path program 2 times [2018-06-22 11:11:52,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:52,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:52,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:52,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,148 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:11:53,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:53,148 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:53,155 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:53,174 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:53,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,176 INFO ]: Computing forward predicates... [2018-06-22 11:11:53,379 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:11:53,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:53,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:11:53,400 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:11:53,400 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:11:53,400 INFO ]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:53,400 INFO ]: Start difference. First operand 77 states and 138 transitions. Second operand 20 states. [2018-06-22 11:11:54,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:54,530 INFO ]: Finished difference Result 91 states and 162 transitions. [2018-06-22 11:11:54,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:11:54,530 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:11:54,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:54,531 INFO ]: With dead ends: 91 [2018-06-22 11:11:54,531 INFO ]: Without dead ends: 91 [2018-06-22 11:11:54,531 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:11:54,532 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:11:54,536 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 75. [2018-06-22 11:11:54,536 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:11:54,537 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2018-06-22 11:11:54,537 INFO ]: Start accepts. Automaton has 75 states and 136 transitions. Word has length 25 [2018-06-22 11:11:54,537 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:54,537 INFO ]: Abstraction has 75 states and 136 transitions. [2018-06-22 11:11:54,537 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:11:54,537 INFO ]: Start isEmpty. Operand 75 states and 136 transitions. [2018-06-22 11:11:54,538 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:54,538 INFO ]: Found error trace [2018-06-22 11:11:54,538 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:54,538 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:54,538 INFO ]: Analyzing trace with hash 1953340290, now seen corresponding path program 1 times [2018-06-22 11:11:54,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:54,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:54,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:54,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,700 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:11:54,700 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:54,700 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:54,701 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:54,701 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:54,701 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:54,701 INFO ]: Start difference. First operand 75 states and 136 transitions. Second operand 4 states. [2018-06-22 11:11:54,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:54,763 INFO ]: Finished difference Result 75 states and 120 transitions. [2018-06-22 11:11:54,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:54,763 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:11:54,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:54,764 INFO ]: With dead ends: 75 [2018-06-22 11:11:54,764 INFO ]: Without dead ends: 75 [2018-06-22 11:11:54,764 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 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:11:54,764 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:11:54,767 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-06-22 11:11:54,767 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:11:54,767 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 113 transitions. [2018-06-22 11:11:54,768 INFO ]: Start accepts. Automaton has 69 states and 113 transitions. Word has length 25 [2018-06-22 11:11:54,768 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:54,768 INFO ]: Abstraction has 69 states and 113 transitions. [2018-06-22 11:11:54,768 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:54,768 INFO ]: Start isEmpty. Operand 69 states and 113 transitions. [2018-06-22 11:11:54,768 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:54,769 INFO ]: Found error trace [2018-06-22 11:11:54,769 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:54,769 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:54,769 INFO ]: Analyzing trace with hash -406601877, now seen corresponding path program 3 times [2018-06-22 11:11:54,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:54,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:54,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:54,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,973 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:11:54,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:54,973 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:11:54,978 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:54,998 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:11:54,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,999 INFO ]: Computing forward predicates... [2018-06-22 11:11:55,254 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:11:55,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:55,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-22 11:11:55,274 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:11:55,274 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:11:55,274 INFO ]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:11:55,274 INFO ]: Start difference. First operand 69 states and 113 transitions. Second operand 19 states. [2018-06-22 11:11:55,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:55,704 INFO ]: Finished difference Result 97 states and 158 transitions. [2018-06-22 11:11:55,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:55,707 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:11:55,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:55,708 INFO ]: With dead ends: 97 [2018-06-22 11:11:55,708 INFO ]: Without dead ends: 97 [2018-06-22 11:11:55,708 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:11:55,708 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:11:55,712 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-06-22 11:11:55,712 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:11:55,713 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2018-06-22 11:11:55,713 INFO ]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 25 [2018-06-22 11:11:55,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:55,713 INFO ]: Abstraction has 61 states and 101 transitions. [2018-06-22 11:11:55,713 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:11:55,713 INFO ]: Start isEmpty. Operand 61 states and 101 transitions. [2018-06-22 11:11:55,714 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:55,714 INFO ]: Found error trace [2018-06-22 11:11:55,714 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:11:55,714 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:55,714 INFO ]: Analyzing trace with hash 401957634, now seen corresponding path program 3 times [2018-06-22 11:11:55,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:55,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:55,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:55,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:55,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:55,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:55,835 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:55,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:55,835 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:11:55,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:55,862 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:11:55,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:55,864 INFO ]: Computing forward predicates... [2018-06-22 11:11:55,950 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:55,970 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:55,970 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 11:11:55,970 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:11:55,970 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:11:55,970 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:11:55,971 INFO ]: Start difference. First operand 61 states and 101 transitions. Second operand 16 states. [2018-06-22 11:11:56,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:56,387 INFO ]: Finished difference Result 93 states and 155 transitions. [2018-06-22 11:11:56,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:56,388 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:11:56,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:56,389 INFO ]: With dead ends: 93 [2018-06-22 11:11:56,389 INFO ]: Without dead ends: 93 [2018-06-22 11:11:56,389 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:56,389 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:11:56,394 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 65. [2018-06-22 11:11:56,394 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:11:56,395 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2018-06-22 11:11:56,395 INFO ]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 25 [2018-06-22 11:11:56,395 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:56,395 INFO ]: Abstraction has 65 states and 109 transitions. [2018-06-22 11:11:56,395 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:11:56,395 INFO ]: Start isEmpty. Operand 65 states and 109 transitions. [2018-06-22 11:11:56,396 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:56,396 INFO ]: Found error trace [2018-06-22 11:11:56,396 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:11:56,396 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:56,396 INFO ]: Analyzing trace with hash -1720990780, now seen corresponding path program 4 times [2018-06-22 11:11:56,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:56,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:56,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,396 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:56,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:57,305 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:11:57,891 INFO ]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:11:57,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:57,891 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:11:57,897 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:11:57,917 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:11:57,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:57,918 INFO ]: Computing forward predicates... [2018-06-22 11:11:58,193 INFO ]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:11:58,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:58,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-06-22 11:11:58,221 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:11:58,221 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:11:58,221 INFO ]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:58,221 INFO ]: Start difference. First operand 65 states and 109 transitions. Second operand 22 states. [2018-06-22 11:12:05,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:05,089 INFO ]: Finished difference Result 99 states and 159 transitions. [2018-06-22 11:12:05,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:12:05,184 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:12:05,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:05,185 INFO ]: With dead ends: 99 [2018-06-22 11:12:05,185 INFO ]: Without dead ends: 99 [2018-06-22 11:12:05,185 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:12:05,185 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:12:05,188 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 61. [2018-06-22 11:12:05,188 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:12:05,188 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2018-06-22 11:12:05,188 INFO ]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 29 [2018-06-22 11:12:05,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:05,189 INFO ]: Abstraction has 61 states and 101 transitions. [2018-06-22 11:12:05,189 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:12:05,189 INFO ]: Start isEmpty. Operand 61 states and 101 transitions. [2018-06-22 11:12:05,189 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:12:05,189 INFO ]: Found error trace [2018-06-22 11:12:05,189 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:05,189 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:05,189 INFO ]: Analyzing trace with hash -397859103, now seen corresponding path program 4 times [2018-06-22 11:12:05,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:05,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:05,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:05,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:05,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:05,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,320 INFO ]: Checked inductivity of 51 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:12:05,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:05,321 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:12:05,331 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:12:05,356 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:12:05,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,358 INFO ]: Computing forward predicates... [2018-06-22 11:12:05,446 INFO ]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:05,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:05,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 14 [2018-06-22 11:12:05,465 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:12:05,465 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:12:05,465 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:12:05,465 INFO ]: Start difference. First operand 61 states and 101 transitions. Second operand 14 states. [2018-06-22 11:12:05,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:05,693 INFO ]: Finished difference Result 99 states and 147 transitions. [2018-06-22 11:12:05,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:05,693 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:12:05,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:05,694 INFO ]: With dead ends: 99 [2018-06-22 11:12:05,694 INFO ]: Without dead ends: 95 [2018-06-22 11:12:05,694 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:12:05,694 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:12:05,696 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 41. [2018-06-22 11:12:05,696 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:12:05,696 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-06-22 11:12:05,696 INFO ]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 29 [2018-06-22 11:12:05,696 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:05,696 INFO ]: Abstraction has 41 states and 59 transitions. [2018-06-22 11:12:05,696 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:12:05,696 INFO ]: Start isEmpty. Operand 41 states and 59 transitions. [2018-06-22 11:12:05,697 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:12:05,697 INFO ]: Found error trace [2018-06-22 11:12:05,697 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:05,697 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:05,697 INFO ]: Analyzing trace with hash 660197435, now seen corresponding path program 1 times [2018-06-22 11:12:05,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:05,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:05,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:05,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:05,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:05,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,862 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:05,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:05,862 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:12:05,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:05,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,895 INFO ]: Computing forward predicates... [2018-06-22 11:12:06,046 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:06,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:06,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-22 11:12:06,066 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:12:06,066 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:12:06,066 INFO ]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:12:06,066 INFO ]: Start difference. First operand 41 states and 59 transitions. Second operand 18 states. [2018-06-22 11:12:06,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:06,425 INFO ]: Finished difference Result 65 states and 91 transitions. [2018-06-22 11:12:06,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:12:06,425 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:12:06,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:06,425 INFO ]: With dead ends: 65 [2018-06-22 11:12:06,425 INFO ]: Without dead ends: 65 [2018-06-22 11:12:06,426 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:12:06,426 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:12:06,428 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-06-22 11:12:06,428 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:12:06,428 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2018-06-22 11:12:06,428 INFO ]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 29 [2018-06-22 11:12:06,428 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:06,428 INFO ]: Abstraction has 47 states and 69 transitions. [2018-06-22 11:12:06,428 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:12:06,428 INFO ]: Start isEmpty. Operand 47 states and 69 transitions. [2018-06-22 11:12:06,429 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:12:06,429 INFO ]: Found error trace [2018-06-22 11:12:06,429 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:06,429 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:06,429 INFO ]: Analyzing trace with hash 1485104136, now seen corresponding path program 1 times [2018-06-22 11:12:06,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:06,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:06,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:06,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:06,604 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:06,604 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:06,604 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:12:06,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:06,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:06,630 INFO ]: Computing forward predicates... [2018-06-22 11:12:06,921 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:06,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:06,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:12:06,943 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:12:06,943 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:12:06,943 INFO ]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:12:06,943 INFO ]: Start difference. First operand 47 states and 69 transitions. Second operand 21 states. [2018-06-22 11:12:07,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:07,290 INFO ]: Finished difference Result 73 states and 100 transitions. [2018-06-22 11:12:07,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:07,291 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:12:07,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:07,291 INFO ]: With dead ends: 73 [2018-06-22 11:12:07,291 INFO ]: Without dead ends: 73 [2018-06-22 11:12:07,292 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:12:07,292 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:12:07,294 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 49. [2018-06-22 11:12:07,294 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:12:07,294 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-06-22 11:12:07,294 INFO ]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 29 [2018-06-22 11:12:07,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:07,294 INFO ]: Abstraction has 49 states and 71 transitions. [2018-06-22 11:12:07,294 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:12:07,295 INFO ]: Start isEmpty. Operand 49 states and 71 transitions. [2018-06-22 11:12:07,295 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:12:07,295 INFO ]: Found error trace [2018-06-22 11:12:07,295 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:07,295 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:07,295 INFO ]: Analyzing trace with hash 1480265302, now seen corresponding path program 5 times [2018-06-22 11:12:07,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:07,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:07,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:07,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:07,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:07,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:07,512 INFO ]: Checked inductivity of 48 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:12:07,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:07,512 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:12:07,521 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:12:07,546 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:12:07,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:07,547 INFO ]: Computing forward predicates... [2018-06-22 11:12:12,994 INFO ]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:12:13,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:13,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-06-22 11:12:13,014 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:12:13,014 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:12:13,015 INFO ]: CoverageRelationStatistics Valid=55, Invalid=311, Unknown=14, NotChecked=0, Total=380 [2018-06-22 11:12:13,015 INFO ]: Start difference. First operand 49 states and 71 transitions. Second operand 20 states. [2018-06-22 11:12:16,768 WARN ]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 11:12:17,629 WARN ]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 11:12:18,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:18,166 INFO ]: Finished difference Result 71 states and 97 transitions. [2018-06-22 11:12:18,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:18,167 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:12:18,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:18,168 INFO ]: With dead ends: 71 [2018-06-22 11:12:18,168 INFO ]: Without dead ends: 63 [2018-06-22 11:12:18,168 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=136, Invalid=661, Unknown=15, NotChecked=0, Total=812 [2018-06-22 11:12:18,168 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:12:18,170 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 49. [2018-06-22 11:12:18,170 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:12:18,171 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2018-06-22 11:12:18,171 INFO ]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 29 [2018-06-22 11:12:18,171 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:18,171 INFO ]: Abstraction has 49 states and 70 transitions. [2018-06-22 11:12:18,171 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:12:18,171 INFO ]: Start isEmpty. Operand 49 states and 70 transitions. [2018-06-22 11:12:18,171 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:12:18,171 INFO ]: Found error trace [2018-06-22 11:12:18,171 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:18,172 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:18,172 INFO ]: Analyzing trace with hash 470408308, now seen corresponding path program 1 times [2018-06-22 11:12:18,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:18,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:18,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:18,172 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:18,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:18,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:18,534 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:18,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:18,534 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:12:18,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:18,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:18,560 INFO ]: Computing forward predicates... [2018-06-22 11:12:18,813 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:12:18,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:18,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:12:18,833 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:12:18,834 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:12:18,834 INFO ]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:12:18,834 INFO ]: Start difference. First operand 49 states and 70 transitions. Second operand 21 states. [2018-06-22 11:12:19,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:19,456 INFO ]: Finished difference Result 79 states and 105 transitions. [2018-06-22 11:12:19,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:19,456 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:12:19,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:19,457 INFO ]: With dead ends: 79 [2018-06-22 11:12:19,457 INFO ]: Without dead ends: 79 [2018-06-22 11:12:19,457 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:12:19,457 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:12:19,459 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 51. [2018-06-22 11:12:19,459 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:12:19,460 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2018-06-22 11:12:19,460 INFO ]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 29 [2018-06-22 11:12:19,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:19,460 INFO ]: Abstraction has 51 states and 72 transitions. [2018-06-22 11:12:19,460 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:12:19,460 INFO ]: Start isEmpty. Operand 51 states and 72 transitions. [2018-06-22 11:12:19,460 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:12:19,460 INFO ]: Found error trace [2018-06-22 11:12:19,460 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:19,460 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:19,460 INFO ]: Analyzing trace with hash -430366083, now seen corresponding path program 2 times [2018-06-22 11:12:19,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:19,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:19,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:19,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:19,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:19,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:19,651 INFO ]: Checked inductivity of 67 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:12:19,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:19,651 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:12:19,658 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:12:19,683 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:12:19,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:19,684 INFO ]: Computing forward predicates... [2018-06-22 11:12:23,009 INFO ]: Checked inductivity of 67 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:12:23,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:23,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-06-22 11:12:23,029 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:12:23,029 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:12:23,029 INFO ]: CoverageRelationStatistics Valid=77, Invalid=428, Unknown=1, NotChecked=0, Total=506 [2018-06-22 11:12:23,029 INFO ]: Start difference. First operand 51 states and 72 transitions. Second operand 23 states. [2018-06-22 11:12:24,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:24,717 INFO ]: Finished difference Result 71 states and 97 transitions. [2018-06-22 11:12:24,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:12:24,717 INFO ]: Start accepts. Automaton has 23 states. Word has length 33 [2018-06-22 11:12:24,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:24,718 INFO ]: With dead ends: 71 [2018-06-22 11:12:24,718 INFO ]: Without dead ends: 71 [2018-06-22 11:12:24,718 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=190, Invalid=865, Unknown=1, NotChecked=0, Total=1056 [2018-06-22 11:12:24,718 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:12:24,720 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 53. [2018-06-22 11:12:24,720 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:12:24,721 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2018-06-22 11:12:24,721 INFO ]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 33 [2018-06-22 11:12:24,721 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:24,721 INFO ]: Abstraction has 53 states and 74 transitions. [2018-06-22 11:12:24,721 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:12:24,721 INFO ]: Start isEmpty. Operand 53 states and 74 transitions. [2018-06-22 11:12:24,723 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:12:24,723 INFO ]: Found error trace [2018-06-22 11:12:24,723 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:24,723 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:24,723 INFO ]: Analyzing trace with hash 1982294552, now seen corresponding path program 6 times [2018-06-22 11:12:24,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:24,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:24,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:24,723 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:24,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:24,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:25,260 INFO ]: Checked inductivity of 67 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:12:25,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:25,260 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:12:25,266 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:12:25,294 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:12:25,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:25,296 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 11:12:25,733 INFO ]: Timeout while computing interpolants [2018-06-22 11:12:25,934 WARN ]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:25,934 WARN ]: Verification canceled [2018-06-22 11:12:25,945 WARN ]: Timeout [2018-06-22 11:12:25,945 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:12:25 BoogieIcfgContainer [2018-06-22 11:12:25,945 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:12:25,946 INFO ]: Toolchain (without parser) took 60390.95 ms. Allocated memory was 304.1 MB in the beginning and 653.8 MB in the end (delta: 349.7 MB). Free memory was 258.6 MB in the beginning and 381.4 MB in the end (delta: -122.8 MB). Peak memory consumption was 226.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:25,948 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:12:25,948 INFO ]: ChcToBoogie took 48.76 ms. Allocated memory is still 304.1 MB. Free memory was 257.6 MB in the beginning and 255.6 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:12:25,948 INFO ]: Boogie Preprocessor took 49.02 ms. Allocated memory is still 304.1 MB. Free memory was 255.6 MB in the beginning and 254.6 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:12:25,949 INFO ]: RCFGBuilder took 427.28 ms. Allocated memory is still 304.1 MB. Free memory was 254.6 MB in the beginning and 241.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:25,949 INFO ]: TraceAbstraction took 59831.33 ms. Allocated memory was 304.1 MB in the beginning and 653.8 MB in the end (delta: 349.7 MB). Free memory was 241.6 MB in the beginning and 381.4 MB in the end (delta: -139.8 MB). Peak memory consumption was 209.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:25,955 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.76 ms. Allocated memory is still 304.1 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.02 ms. Allocated memory is still 304.1 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 427.28 ms. Allocated memory is still 304.1 MB. Free memory was 254.6 MB in the beginning and 241.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59831.33 ms. Allocated memory was 304.1 MB in the beginning and 653.8 MB in the end (delta: 349.7 MB). Free memory was 241.6 MB in the beginning and 381.4 MB in the end (delta: -139.8 MB). Peak memory consumption was 209.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. TIMEOUT Result, 59.7s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 34.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1159 SDtfs, 312 SDslu, 3264 SDs, 0 SdLazy, 9766 SolverSat, 1159 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 514 SyntacticMatches, 10 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=10, 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.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 774 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 1272 ConstructedInterpolants, 110 QuantifiedInterpolants, 188664 SizeOfPredicates, 174 NumberOfNonLiveVariables, 4244 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 65 InterpolantComputations, 10 PerfectInterpolantSequences, 686/1403 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/008b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-12-25-979.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-12-25-979.csv Completed graceful shutdown