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/009-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:12:29,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:12:29,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:12:29,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:12:29,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:12:29,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:12:29,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:12:29,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:12:29,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:12:29,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:12:29,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:12:29,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:12:29,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:12:29,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:12:29,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:12:29,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:12:29,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:12:29,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:12:29,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:12:29,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:12:29,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:12:29,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:12:29,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:12:29,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:12:29,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:12:29,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:12:29,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:12:29,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:12:29,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:12:29,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:12:29,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:12:29,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:12:29,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:12:29,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:12:29,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:12:29,134 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:12:29,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:12:29,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:12:29,149 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:12:29,149 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:12:29,150 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:12:29,151 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:12:29,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:12:29,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:12:29,151 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:12:29,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:12:29,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:12:29,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:12:29,152 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:12:29,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:12:29,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:12:29,153 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:12:29,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:12:29,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:12:29,153 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:12:29,155 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:12:29,155 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:12:29,192 INFO ]: Repository-Root is: /tmp [2018-06-22 11:12:29,208 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:12:29,214 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:12:29,215 INFO ]: Initializing SmtParser... [2018-06-22 11:12:29,216 INFO ]: SmtParser initialized [2018-06-22 11:12:29,217 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 [2018-06-22 11:12:29,218 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:12:29,321 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 unknown [2018-06-22 11:12:29,955 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009-horn.smt2 [2018-06-22 11:12:29,961 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:12:29,966 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:12:29,967 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:12:29,967 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:12:29,967 INFO ]: ChcToBoogie initialized [2018-06-22 11:12:29,971 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:12:29" (1/1) ... [2018-06-22 11:12:30,044 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30 Unit [2018-06-22 11:12:30,044 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:12:30,045 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:12:30,045 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:12:30,045 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:12:30,068 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,069 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,090 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,090 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,111 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,114 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,118 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... [2018-06-22 11:12:30,121 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:12:30,122 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:12:30,122 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:12:30,122 INFO ]: RCFGBuilder initialized [2018-06-22 11:12:30,123 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:12:30,145 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:12:30,145 INFO ]: Found specification of procedure False [2018-06-22 11:12:30,145 INFO ]: Found implementation of procedure False [2018-06-22 11:12:30,145 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:12:30,145 INFO ]: Found specification of procedure INV1 [2018-06-22 11:12:30,145 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:12:30,145 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:12:30,145 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:12:30,145 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:12:31,501 INFO ]: Using library mode [2018-06-22 11:12:31,505 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:31 BoogieIcfgContainer [2018-06-22 11:12:31,506 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:12:31,507 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:12:31,507 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:12:31,514 INFO ]: TraceAbstraction initialized [2018-06-22 11:12:31,514 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:12:29" (1/3) ... [2018-06-22 11:12:31,515 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b826203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:12:31, skipping insertion in model container [2018-06-22 11:12:31,515 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:30" (2/3) ... [2018-06-22 11:12:31,515 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b826203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:12:31, skipping insertion in model container [2018-06-22 11:12:31,515 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:31" (3/3) ... [2018-06-22 11:12:31,518 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:12:31,527 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:12:31,537 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:12:31,583 INFO ]: Using default assertion order modulation [2018-06-22 11:12:31,584 INFO ]: Interprodecural is true [2018-06-22 11:12:31,584 INFO ]: Hoare is false [2018-06-22 11:12:31,584 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:12:31,584 INFO ]: Backedges is TWOTRACK [2018-06-22 11:12:31,584 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:12:31,584 INFO ]: Difference is false [2018-06-22 11:12:31,584 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:12:31,584 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:12:31,603 INFO ]: Start isEmpty. Operand 41 states. [2018-06-22 11:12:31,651 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:12:31,651 INFO ]: Found error trace [2018-06-22 11:12:31,652 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:31,652 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:31,661 INFO ]: Analyzing trace with hash -1706107279, now seen corresponding path program 1 times [2018-06-22 11:12:31,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:31,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:31,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:31,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:31,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:31,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:31,911 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:12:31,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:31,914 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:31,916 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:31,947 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:31,948 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:31,959 INFO ]: Start difference. First operand 41 states. Second operand 4 states. [2018-06-22 11:12:33,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:33,079 INFO ]: Finished difference Result 41 states and 126 transitions. [2018-06-22 11:12:33,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:33,080 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:12:33,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:33,097 INFO ]: With dead ends: 41 [2018-06-22 11:12:33,097 INFO ]: Without dead ends: 41 [2018-06-22 11:12:33,099 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:12:33,117 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:12:33,165 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:12:33,167 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:12:33,170 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 126 transitions. [2018-06-22 11:12:33,171 INFO ]: Start accepts. Automaton has 41 states and 126 transitions. Word has length 9 [2018-06-22 11:12:33,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:33,172 INFO ]: Abstraction has 41 states and 126 transitions. [2018-06-22 11:12:33,172 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:33,172 INFO ]: Start isEmpty. Operand 41 states and 126 transitions. [2018-06-22 11:12:33,186 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:33,186 INFO ]: Found error trace [2018-06-22 11:12:33,186 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:33,186 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:33,186 INFO ]: Analyzing trace with hash 11438465, now seen corresponding path program 1 times [2018-06-22 11:12:33,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:33,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:33,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:33,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:33,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:33,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:33,348 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:12:33,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:33,348 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:33,350 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:33,350 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:33,350 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:33,350 INFO ]: Start difference. First operand 41 states and 126 transitions. Second operand 4 states. [2018-06-22 11:12:34,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:34,612 INFO ]: Finished difference Result 63 states and 315 transitions. [2018-06-22 11:12:34,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:34,613 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:34,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:34,621 INFO ]: With dead ends: 63 [2018-06-22 11:12:34,621 INFO ]: Without dead ends: 63 [2018-06-22 11:12:34,622 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:34,622 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:12:34,670 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-06-22 11:12:34,670 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:12:34,674 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 275 transitions. [2018-06-22 11:12:34,674 INFO ]: Start accepts. Automaton has 61 states and 275 transitions. Word has length 13 [2018-06-22 11:12:34,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:34,674 INFO ]: Abstraction has 61 states and 275 transitions. [2018-06-22 11:12:34,674 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:34,674 INFO ]: Start isEmpty. Operand 61 states and 275 transitions. [2018-06-22 11:12:34,681 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:34,681 INFO ]: Found error trace [2018-06-22 11:12:34,681 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:34,681 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:34,682 INFO ]: Analyzing trace with hash 577341505, now seen corresponding path program 1 times [2018-06-22 11:12:34,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:34,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:34,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:34,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:34,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:34,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:34,753 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:12:34,753 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:34,753 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:34,753 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:34,753 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:34,753 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:34,754 INFO ]: Start difference. First operand 61 states and 275 transitions. Second operand 4 states. [2018-06-22 11:12:35,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:35,746 INFO ]: Finished difference Result 69 states and 424 transitions. [2018-06-22 11:12:35,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:35,747 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:35,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:35,753 INFO ]: With dead ends: 69 [2018-06-22 11:12:35,753 INFO ]: Without dead ends: 69 [2018-06-22 11:12:35,753 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:12:35,754 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:12:35,794 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-06-22 11:12:35,794 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:12:35,797 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 307 transitions. [2018-06-22 11:12:35,797 INFO ]: Start accepts. Automaton has 63 states and 307 transitions. Word has length 13 [2018-06-22 11:12:35,797 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:35,797 INFO ]: Abstraction has 63 states and 307 transitions. [2018-06-22 11:12:35,797 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:35,797 INFO ]: Start isEmpty. Operand 63 states and 307 transitions. [2018-06-22 11:12:35,803 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:35,804 INFO ]: Found error trace [2018-06-22 11:12:35,804 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:35,804 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:35,804 INFO ]: Analyzing trace with hash 1684047712, now seen corresponding path program 1 times [2018-06-22 11:12:35,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:35,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:35,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:35,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:35,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:35,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:35,922 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:12:35,922 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:35,922 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:35,922 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:35,922 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:35,922 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:35,922 INFO ]: Start difference. First operand 63 states and 307 transitions. Second operand 4 states. [2018-06-22 11:12:36,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:36,811 INFO ]: Finished difference Result 67 states and 382 transitions. [2018-06-22 11:12:36,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:36,811 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:36,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:36,815 INFO ]: With dead ends: 67 [2018-06-22 11:12:36,816 INFO ]: Without dead ends: 67 [2018-06-22 11:12:36,816 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:36,816 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:12:36,842 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-06-22 11:12:36,842 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:12:36,844 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 301 transitions. [2018-06-22 11:12:36,844 INFO ]: Start accepts. Automaton has 63 states and 301 transitions. Word has length 13 [2018-06-22 11:12:36,844 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:36,844 INFO ]: Abstraction has 63 states and 301 transitions. [2018-06-22 11:12:36,844 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:36,844 INFO ]: Start isEmpty. Operand 63 states and 301 transitions. [2018-06-22 11:12:36,850 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:36,850 INFO ]: Found error trace [2018-06-22 11:12:36,850 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:36,851 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:36,851 INFO ]: Analyzing trace with hash 332090652, now seen corresponding path program 1 times [2018-06-22 11:12:36,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:36,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:36,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:36,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:36,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:36,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:37,005 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:12:37,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:37,005 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:37,005 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:37,005 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:37,005 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:37,005 INFO ]: Start difference. First operand 63 states and 301 transitions. Second operand 4 states. [2018-06-22 11:12:37,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:37,303 INFO ]: Finished difference Result 71 states and 452 transitions. [2018-06-22 11:12:37,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:37,306 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:37,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:37,310 INFO ]: With dead ends: 71 [2018-06-22 11:12:37,310 INFO ]: Without dead ends: 71 [2018-06-22 11:12:37,310 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:12:37,310 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:12:37,339 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 11:12:37,339 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:12:37,341 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 411 transitions. [2018-06-22 11:12:37,342 INFO ]: Start accepts. Automaton has 69 states and 411 transitions. Word has length 13 [2018-06-22 11:12:37,342 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:37,342 INFO ]: Abstraction has 69 states and 411 transitions. [2018-06-22 11:12:37,342 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:37,342 INFO ]: Start isEmpty. Operand 69 states and 411 transitions. [2018-06-22 11:12:37,349 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:37,349 INFO ]: Found error trace [2018-06-22 11:12:37,349 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:37,349 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:37,349 INFO ]: Analyzing trace with hash -479063241, now seen corresponding path program 1 times [2018-06-22 11:12:37,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:37,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:37,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:37,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:37,385 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:12:37,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:37,385 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:37,385 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:37,385 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:37,385 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:37,386 INFO ]: Start difference. First operand 69 states and 411 transitions. Second operand 4 states. [2018-06-22 11:12:37,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:37,685 INFO ]: Finished difference Result 71 states and 449 transitions. [2018-06-22 11:12:37,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:37,685 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:37,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:37,688 INFO ]: With dead ends: 71 [2018-06-22 11:12:37,688 INFO ]: Without dead ends: 71 [2018-06-22 11:12:37,691 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:12:37,691 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:12:37,725 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 11:12:37,725 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:12:37,727 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 408 transitions. [2018-06-22 11:12:37,727 INFO ]: Start accepts. Automaton has 69 states and 408 transitions. Word has length 13 [2018-06-22 11:12:37,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:37,727 INFO ]: Abstraction has 69 states and 408 transitions. [2018-06-22 11:12:37,727 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:37,728 INFO ]: Start isEmpty. Operand 69 states and 408 transitions. [2018-06-22 11:12:37,740 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:37,740 INFO ]: Found error trace [2018-06-22 11:12:37,740 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:37,740 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:37,740 INFO ]: Analyzing trace with hash 1193546006, now seen corresponding path program 1 times [2018-06-22 11:12:37,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:37,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:37,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:37,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:37,823 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:12:37,823 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:37,823 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:37,823 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:37,823 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:37,823 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:37,824 INFO ]: Start difference. First operand 69 states and 408 transitions. Second operand 4 states. [2018-06-22 11:12:38,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:38,951 INFO ]: Finished difference Result 75 states and 485 transitions. [2018-06-22 11:12:38,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:38,952 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:38,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:38,955 INFO ]: With dead ends: 75 [2018-06-22 11:12:38,955 INFO ]: Without dead ends: 75 [2018-06-22 11:12:38,955 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:38,956 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:12:38,982 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-06-22 11:12:38,982 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:12:38,984 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 373 transitions. [2018-06-22 11:12:38,984 INFO ]: Start accepts. Automaton has 69 states and 373 transitions. Word has length 13 [2018-06-22 11:12:38,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:38,984 INFO ]: Abstraction has 69 states and 373 transitions. [2018-06-22 11:12:38,984 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:38,984 INFO ]: Start isEmpty. Operand 69 states and 373 transitions. [2018-06-22 11:12:38,991 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:38,991 INFO ]: Found error trace [2018-06-22 11:12:38,991 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:38,991 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:38,991 INFO ]: Analyzing trace with hash -724314094, now seen corresponding path program 1 times [2018-06-22 11:12:38,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:38,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:38,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:38,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:38,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:39,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:39,137 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:12:39,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:39,137 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:12:39,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:39,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:39,181 INFO ]: Computing forward predicates... [2018-06-22 11:12:39,504 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:12:39,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:39,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:39,536 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:39,536 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:39,536 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:39,537 INFO ]: Start difference. First operand 69 states and 373 transitions. Second operand 9 states. [2018-06-22 11:12:40,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:40,503 INFO ]: Finished difference Result 79 states and 508 transitions. [2018-06-22 11:12:40,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:12:40,503 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:40,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:40,507 INFO ]: With dead ends: 79 [2018-06-22 11:12:40,507 INFO ]: Without dead ends: 79 [2018-06-22 11:12:40,507 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:40,507 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:12:40,556 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-06-22 11:12:40,556 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:40,558 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 435 transitions. [2018-06-22 11:12:40,558 INFO ]: Start accepts. Automaton has 73 states and 435 transitions. Word has length 13 [2018-06-22 11:12:40,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:40,558 INFO ]: Abstraction has 73 states and 435 transitions. [2018-06-22 11:12:40,558 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:40,558 INFO ]: Start isEmpty. Operand 73 states and 435 transitions. [2018-06-22 11:12:40,565 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:40,565 INFO ]: Found error trace [2018-06-22 11:12:40,565 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:40,566 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:40,566 INFO ]: Analyzing trace with hash -158411054, now seen corresponding path program 1 times [2018-06-22 11:12:40,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:40,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:40,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:40,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:40,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:40,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:40,701 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:12:40,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:40,701 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:12:40,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:40,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:40,744 INFO ]: Computing forward predicates... [2018-06-22 11:12:40,927 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:12:40,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:40,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:40,947 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:40,947 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:40,947 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:40,947 INFO ]: Start difference. First operand 73 states and 435 transitions. Second operand 9 states. [2018-06-22 11:12:41,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:41,353 INFO ]: Finished difference Result 81 states and 536 transitions. [2018-06-22 11:12:41,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:12:41,353 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:41,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:41,356 INFO ]: With dead ends: 81 [2018-06-22 11:12:41,356 INFO ]: Without dead ends: 81 [2018-06-22 11:12:41,356 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:12:41,357 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:12:41,392 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-06-22 11:12:41,392 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:41,394 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 435 transitions. [2018-06-22 11:12:41,395 INFO ]: Start accepts. Automaton has 73 states and 435 transitions. Word has length 13 [2018-06-22 11:12:41,395 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:41,395 INFO ]: Abstraction has 73 states and 435 transitions. [2018-06-22 11:12:41,395 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:41,395 INFO ]: Start isEmpty. Operand 73 states and 435 transitions. [2018-06-22 11:12:41,401 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:41,401 INFO ]: Found error trace [2018-06-22 11:12:41,401 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:41,401 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:41,401 INFO ]: Analyzing trace with hash -1755618967, now seen corresponding path program 1 times [2018-06-22 11:12:41,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:41,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:41,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:41,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:41,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:41,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:41,516 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:12:41,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:41,517 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:41,517 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:41,517 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:41,517 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:41,517 INFO ]: Start difference. First operand 73 states and 435 transitions. Second operand 4 states. [2018-06-22 11:12:42,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:42,124 INFO ]: Finished difference Result 85 states and 591 transitions. [2018-06-22 11:12:42,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:42,124 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:42,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:42,127 INFO ]: With dead ends: 85 [2018-06-22 11:12:42,127 INFO ]: Without dead ends: 85 [2018-06-22 11:12:42,127 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:42,127 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:12:42,159 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-06-22 11:12:42,159 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:42,161 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 421 transitions. [2018-06-22 11:12:42,161 INFO ]: Start accepts. Automaton has 73 states and 421 transitions. Word has length 13 [2018-06-22 11:12:42,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:42,161 INFO ]: Abstraction has 73 states and 421 transitions. [2018-06-22 11:12:42,161 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:42,161 INFO ]: Start isEmpty. Operand 73 states and 421 transitions. [2018-06-22 11:12:42,169 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:42,169 INFO ]: Found error trace [2018-06-22 11:12:42,169 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:42,170 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:42,170 INFO ]: Analyzing trace with hash -1139414466, now seen corresponding path program 1 times [2018-06-22 11:12:42,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:42,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:42,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:42,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:42,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:42,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:42,324 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:12:42,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:42,324 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:12:42,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:42,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:42,346 INFO ]: Computing forward predicates... [2018-06-22 11:12:42,529 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:12:42,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:42,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:42,564 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:42,564 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:42,564 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:42,564 INFO ]: Start difference. First operand 73 states and 421 transitions. Second operand 9 states. [2018-06-22 11:12:43,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:43,399 INFO ]: Finished difference Result 85 states and 588 transitions. [2018-06-22 11:12:43,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:12:43,400 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:43,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:43,403 INFO ]: With dead ends: 85 [2018-06-22 11:12:43,403 INFO ]: Without dead ends: 85 [2018-06-22 11:12:43,404 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:43,404 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:12:43,442 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-06-22 11:12:43,442 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:43,444 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 421 transitions. [2018-06-22 11:12:43,444 INFO ]: Start accepts. Automaton has 73 states and 421 transitions. Word has length 13 [2018-06-22 11:12:43,444 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:43,444 INFO ]: Abstraction has 73 states and 421 transitions. [2018-06-22 11:12:43,444 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:43,444 INFO ]: Start isEmpty. Operand 73 states and 421 transitions. [2018-06-22 11:12:43,449 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:43,449 INFO ]: Found error trace [2018-06-22 11:12:43,449 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:43,450 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:43,450 INFO ]: Analyzing trace with hash -1629916172, now seen corresponding path program 1 times [2018-06-22 11:12:43,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:43,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:43,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:43,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:43,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:43,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:43,548 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:12:43,548 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:43,548 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:43,548 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:43,548 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:43,548 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:43,548 INFO ]: Start difference. First operand 73 states and 421 transitions. Second operand 4 states. [2018-06-22 11:12:43,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:43,782 INFO ]: Finished difference Result 77 states and 481 transitions. [2018-06-22 11:12:43,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:43,784 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:43,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:43,787 INFO ]: With dead ends: 77 [2018-06-22 11:12:43,787 INFO ]: Without dead ends: 77 [2018-06-22 11:12:43,787 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:12:43,787 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:12:43,831 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-06-22 11:12:43,831 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:43,833 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 418 transitions. [2018-06-22 11:12:43,833 INFO ]: Start accepts. Automaton has 73 states and 418 transitions. Word has length 13 [2018-06-22 11:12:43,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:43,833 INFO ]: Abstraction has 73 states and 418 transitions. [2018-06-22 11:12:43,833 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:43,833 INFO ]: Start isEmpty. Operand 73 states and 418 transitions. [2018-06-22 11:12:43,839 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:43,839 INFO ]: Found error trace [2018-06-22 11:12:43,839 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:43,839 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:43,839 INFO ]: Analyzing trace with hash 1313094064, now seen corresponding path program 1 times [2018-06-22 11:12:43,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:43,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:43,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:43,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:43,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:43,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:44,168 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-06-22 11:12:44,292 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:12:44,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:44,292 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:12:44,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:44,333 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:44,334 INFO ]: Computing forward predicates... [2018-06-22 11:12:44,834 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:12:44,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:44,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:12:44,867 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:44,867 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:44,868 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:44,868 INFO ]: Start difference. First operand 73 states and 418 transitions. Second operand 8 states. [2018-06-22 11:12:46,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:46,213 INFO ]: Finished difference Result 83 states and 549 transitions. [2018-06-22 11:12:46,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:12:46,213 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:46,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:46,216 INFO ]: With dead ends: 83 [2018-06-22 11:12:46,216 INFO ]: Without dead ends: 83 [2018-06-22 11:12:46,217 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:46,217 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:12:46,241 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 73. [2018-06-22 11:12:46,241 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:46,243 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 417 transitions. [2018-06-22 11:12:46,243 INFO ]: Start accepts. Automaton has 73 states and 417 transitions. Word has length 13 [2018-06-22 11:12:46,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:46,243 INFO ]: Abstraction has 73 states and 417 transitions. [2018-06-22 11:12:46,243 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:46,243 INFO ]: Start isEmpty. Operand 73 states and 417 transitions. [2018-06-22 11:12:46,248 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:46,248 INFO ]: Found error trace [2018-06-22 11:12:46,248 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:46,248 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:46,248 INFO ]: Analyzing trace with hash 1067843211, now seen corresponding path program 1 times [2018-06-22 11:12:46,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:46,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:46,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:46,388 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:12:46,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:46,389 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:46,389 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:46,389 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:46,389 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:46,389 INFO ]: Start difference. First operand 73 states and 417 transitions. Second operand 4 states. [2018-06-22 11:12:46,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:46,883 INFO ]: Finished difference Result 75 states and 447 transitions. [2018-06-22 11:12:46,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:46,883 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:12:46,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:46,885 INFO ]: With dead ends: 75 [2018-06-22 11:12:46,885 INFO ]: Without dead ends: 75 [2018-06-22 11:12:46,885 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:12:46,885 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:12:46,900 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 11:12:46,900 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:12:46,901 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 410 transitions. [2018-06-22 11:12:46,901 INFO ]: Start accepts. Automaton has 73 states and 410 transitions. Word has length 13 [2018-06-22 11:12:46,902 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:46,902 INFO ]: Abstraction has 73 states and 410 transitions. [2018-06-22 11:12:46,902 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:46,902 INFO ]: Start isEmpty. Operand 73 states and 410 transitions. [2018-06-22 11:12:46,907 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:46,907 INFO ]: Found error trace [2018-06-22 11:12:46,907 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:46,907 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:46,907 INFO ]: Analyzing trace with hash -2039622659, now seen corresponding path program 1 times [2018-06-22 11:12:46,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:46,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:46,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:47,046 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:47,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:47,046 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:47,046 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:47,046 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:47,046 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:47,047 INFO ]: Start difference. First operand 73 states and 410 transitions. Second operand 4 states. [2018-06-22 11:12:47,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:47,396 INFO ]: Finished difference Result 81 states and 460 transitions. [2018-06-22 11:12:47,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:47,396 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:47,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:47,400 INFO ]: With dead ends: 81 [2018-06-22 11:12:47,400 INFO ]: Without dead ends: 81 [2018-06-22 11:12:47,400 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:12:47,400 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:12:47,417 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-06-22 11:12:47,417 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:12:47,419 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 455 transitions. [2018-06-22 11:12:47,419 INFO ]: Start accepts. Automaton has 79 states and 455 transitions. Word has length 17 [2018-06-22 11:12:47,419 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:47,419 INFO ]: Abstraction has 79 states and 455 transitions. [2018-06-22 11:12:47,420 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:47,420 INFO ]: Start isEmpty. Operand 79 states and 455 transitions. [2018-06-22 11:12:47,427 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:47,427 INFO ]: Found error trace [2018-06-22 11:12:47,427 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:47,427 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:47,427 INFO ]: Analyzing trace with hash 839809382, now seen corresponding path program 1 times [2018-06-22 11:12:47,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:47,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:47,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:47,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:47,554 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:12:47,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:47,554 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:47,554 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:47,554 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:47,554 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:47,554 INFO ]: Start difference. First operand 79 states and 455 transitions. Second operand 4 states. [2018-06-22 11:12:48,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:48,056 INFO ]: Finished difference Result 108 states and 774 transitions. [2018-06-22 11:12:48,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:48,062 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:48,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:48,073 INFO ]: With dead ends: 108 [2018-06-22 11:12:48,074 INFO ]: Without dead ends: 108 [2018-06-22 11:12:48,074 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:48,074 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:12:48,113 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-06-22 11:12:48,113 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:12:48,116 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 613 transitions. [2018-06-22 11:12:48,116 INFO ]: Start accepts. Automaton has 96 states and 613 transitions. Word has length 17 [2018-06-22 11:12:48,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:48,116 INFO ]: Abstraction has 96 states and 613 transitions. [2018-06-22 11:12:48,116 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:48,116 INFO ]: Start isEmpty. Operand 96 states and 613 transitions. [2018-06-22 11:12:48,122 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:48,122 INFO ]: Found error trace [2018-06-22 11:12:48,122 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:48,122 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:48,122 INFO ]: Analyzing trace with hash -979904996, now seen corresponding path program 1 times [2018-06-22 11:12:48,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:48,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:48,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:48,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:48,288 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:48,288 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:48,288 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:48,288 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:48,288 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:48,289 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:48,289 INFO ]: Start difference. First operand 96 states and 613 transitions. Second operand 4 states. [2018-06-22 11:12:48,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:48,892 INFO ]: Finished difference Result 104 states and 657 transitions. [2018-06-22 11:12:48,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:48,893 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:48,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:48,896 INFO ]: With dead ends: 104 [2018-06-22 11:12:48,896 INFO ]: Without dead ends: 104 [2018-06-22 11:12:48,896 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:12:48,897 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:12:48,918 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-06-22 11:12:48,918 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:12:48,920 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 602 transitions. [2018-06-22 11:12:48,920 INFO ]: Start accepts. Automaton has 96 states and 602 transitions. Word has length 17 [2018-06-22 11:12:48,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:48,920 INFO ]: Abstraction has 96 states and 602 transitions. [2018-06-22 11:12:48,920 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:48,920 INFO ]: Start isEmpty. Operand 96 states and 602 transitions. [2018-06-22 11:12:48,926 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:48,926 INFO ]: Found error trace [2018-06-22 11:12:48,926 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:48,926 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:48,926 INFO ]: Analyzing trace with hash 1819989572, now seen corresponding path program 1 times [2018-06-22 11:12:48,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:48,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:48,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:48,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:49,072 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:12:49,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:49,073 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:49,073 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:49,073 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:49,073 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:49,073 INFO ]: Start difference. First operand 96 states and 602 transitions. Second operand 4 states. [2018-06-22 11:12:50,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:50,890 INFO ]: Finished difference Result 108 states and 704 transitions. [2018-06-22 11:12:50,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:50,891 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:50,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:50,897 INFO ]: With dead ends: 108 [2018-06-22 11:12:50,897 INFO ]: Without dead ends: 108 [2018-06-22 11:12:50,898 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:12:50,898 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:12:50,930 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-06-22 11:12:50,930 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 11:12:50,932 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 523 transitions. [2018-06-22 11:12:50,932 INFO ]: Start accepts. Automaton has 94 states and 523 transitions. Word has length 17 [2018-06-22 11:12:50,932 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:50,932 INFO ]: Abstraction has 94 states and 523 transitions. [2018-06-22 11:12:50,932 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:50,932 INFO ]: Start isEmpty. Operand 94 states and 523 transitions. [2018-06-22 11:12:50,937 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:50,938 INFO ]: Found error trace [2018-06-22 11:12:50,938 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:50,938 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:50,938 INFO ]: Analyzing trace with hash 1164451032, now seen corresponding path program 1 times [2018-06-22 11:12:50,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:50,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:50,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:50,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:51,090 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:51,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:51,090 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:51,090 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:51,090 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:51,090 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:51,090 INFO ]: Start difference. First operand 94 states and 523 transitions. Second operand 4 states. [2018-06-22 11:12:51,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:51,632 INFO ]: Finished difference Result 108 states and 653 transitions. [2018-06-22 11:12:51,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:51,633 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:51,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:51,637 INFO ]: With dead ends: 108 [2018-06-22 11:12:51,637 INFO ]: Without dead ends: 108 [2018-06-22 11:12:51,638 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:12:51,638 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:12:51,662 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-06-22 11:12:51,662 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:12:51,664 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 523 transitions. [2018-06-22 11:12:51,664 INFO ]: Start accepts. Automaton has 96 states and 523 transitions. Word has length 17 [2018-06-22 11:12:51,664 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:51,664 INFO ]: Abstraction has 96 states and 523 transitions. [2018-06-22 11:12:51,664 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:51,664 INFO ]: Start isEmpty. Operand 96 states and 523 transitions. [2018-06-22 11:12:51,673 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:51,673 INFO ]: Found error trace [2018-06-22 11:12:51,673 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:51,674 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:51,674 INFO ]: Analyzing trace with hash 345717515, now seen corresponding path program 1 times [2018-06-22 11:12:51,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:51,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:51,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:51,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:51,749 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:12:51,749 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:51,749 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:51,750 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:51,750 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:51,750 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:51,750 INFO ]: Start difference. First operand 96 states and 523 transitions. Second operand 4 states. [2018-06-22 11:12:51,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:51,971 INFO ]: Finished difference Result 108 states and 595 transitions. [2018-06-22 11:12:51,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:51,972 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:51,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:51,976 INFO ]: With dead ends: 108 [2018-06-22 11:12:51,976 INFO ]: Without dead ends: 108 [2018-06-22 11:12:51,976 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:12:51,976 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:12:51,994 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-06-22 11:12:51,994 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:12:51,996 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 488 transitions. [2018-06-22 11:12:51,996 INFO ]: Start accepts. Automaton has 96 states and 488 transitions. Word has length 17 [2018-06-22 11:12:51,996 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:51,996 INFO ]: Abstraction has 96 states and 488 transitions. [2018-06-22 11:12:51,996 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:51,996 INFO ]: Start isEmpty. Operand 96 states and 488 transitions. [2018-06-22 11:12:52,002 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:52,002 INFO ]: Found error trace [2018-06-22 11:12:52,002 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:52,002 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:52,002 INFO ]: Analyzing trace with hash 2018530651, now seen corresponding path program 1 times [2018-06-22 11:12:52,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:52,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:52,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:52,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:52,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:52,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:52,165 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:12:52,166 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:52,166 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:52,166 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:52,166 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:52,166 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:52,166 INFO ]: Start difference. First operand 96 states and 488 transitions. Second operand 4 states. [2018-06-22 11:12:52,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:52,553 INFO ]: Finished difference Result 167 states and 967 transitions. [2018-06-22 11:12:52,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:52,553 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:52,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:52,560 INFO ]: With dead ends: 167 [2018-06-22 11:12:52,560 INFO ]: Without dead ends: 167 [2018-06-22 11:12:52,560 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:52,561 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:12:52,594 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 153. [2018-06-22 11:12:52,594 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-22 11:12:52,598 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 901 transitions. [2018-06-22 11:12:52,598 INFO ]: Start accepts. Automaton has 153 states and 901 transitions. Word has length 17 [2018-06-22 11:12:52,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:52,598 INFO ]: Abstraction has 153 states and 901 transitions. [2018-06-22 11:12:52,598 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:52,598 INFO ]: Start isEmpty. Operand 153 states and 901 transitions. [2018-06-22 11:12:52,606 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:52,606 INFO ]: Found error trace [2018-06-22 11:12:52,607 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:52,607 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:52,607 INFO ]: Analyzing trace with hash -1044967532, now seen corresponding path program 1 times [2018-06-22 11:12:52,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:52,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:52,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:52,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:52,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:52,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:52,667 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:12:52,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:52,667 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:52,667 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:52,667 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:52,667 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:52,667 INFO ]: Start difference. First operand 153 states and 901 transitions. Second operand 4 states. [2018-06-22 11:12:53,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:53,080 INFO ]: Finished difference Result 185 states and 1081 transitions. [2018-06-22 11:12:53,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:53,082 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:53,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:53,086 INFO ]: With dead ends: 185 [2018-06-22 11:12:53,087 INFO ]: Without dead ends: 179 [2018-06-22 11:12:53,087 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:12:53,087 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 11:12:53,138 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-06-22 11:12:53,138 INFO ]: Start removeUnreachable. Operand 171 states. [2018-06-22 11:12:53,143 INFO ]: Finished removeUnreachable. Reduced from 171 states to 171 states and 983 transitions. [2018-06-22 11:12:53,144 INFO ]: Start accepts. Automaton has 171 states and 983 transitions. Word has length 17 [2018-06-22 11:12:53,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:53,144 INFO ]: Abstraction has 171 states and 983 transitions. [2018-06-22 11:12:53,144 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:53,144 INFO ]: Start isEmpty. Operand 171 states and 983 transitions. [2018-06-22 11:12:53,153 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:53,153 INFO ]: Found error trace [2018-06-22 11:12:53,154 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:53,154 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:53,154 INFO ]: Analyzing trace with hash -383271646, now seen corresponding path program 1 times [2018-06-22 11:12:53,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:53,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:53,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:53,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:53,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:53,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:53,236 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:12:53,236 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:53,236 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:53,237 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:53,237 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:53,237 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:53,237 INFO ]: Start difference. First operand 171 states and 983 transitions. Second operand 4 states. [2018-06-22 11:12:53,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:53,560 INFO ]: Finished difference Result 223 states and 1337 transitions. [2018-06-22 11:12:53,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:53,561 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:53,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:53,566 INFO ]: With dead ends: 223 [2018-06-22 11:12:53,566 INFO ]: Without dead ends: 217 [2018-06-22 11:12:53,566 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:12:53,566 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-22 11:12:53,621 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-06-22 11:12:53,621 INFO ]: Start removeUnreachable. Operand 211 states. [2018-06-22 11:12:53,626 INFO ]: Finished removeUnreachable. Reduced from 211 states to 211 states and 1253 transitions. [2018-06-22 11:12:53,626 INFO ]: Start accepts. Automaton has 211 states and 1253 transitions. Word has length 17 [2018-06-22 11:12:53,626 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:53,626 INFO ]: Abstraction has 211 states and 1253 transitions. [2018-06-22 11:12:53,626 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:53,626 INFO ]: Start isEmpty. Operand 211 states and 1253 transitions. [2018-06-22 11:12:53,635 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:53,635 INFO ]: Found error trace [2018-06-22 11:12:53,635 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:53,636 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:53,636 INFO ]: Analyzing trace with hash 909973693, now seen corresponding path program 1 times [2018-06-22 11:12:53,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:53,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:53,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:53,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:53,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:53,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:53,792 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:12:53,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:53,793 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:53,793 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:53,793 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:53,793 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:53,793 INFO ]: Start difference. First operand 211 states and 1253 transitions. Second operand 4 states. [2018-06-22 11:12:54,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:54,463 INFO ]: Finished difference Result 227 states and 1276 transitions. [2018-06-22 11:12:54,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:54,463 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:54,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:54,468 INFO ]: With dead ends: 227 [2018-06-22 11:12:54,468 INFO ]: Without dead ends: 227 [2018-06-22 11:12:54,468 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:54,468 INFO ]: Start minimizeSevpa. Operand 227 states. [2018-06-22 11:12:54,512 INFO ]: Finished minimizeSevpa. Reduced states from 227 to 213. [2018-06-22 11:12:54,512 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-22 11:12:54,516 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1199 transitions. [2018-06-22 11:12:54,516 INFO ]: Start accepts. Automaton has 213 states and 1199 transitions. Word has length 17 [2018-06-22 11:12:54,516 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:54,516 INFO ]: Abstraction has 213 states and 1199 transitions. [2018-06-22 11:12:54,516 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:54,516 INFO ]: Start isEmpty. Operand 213 states and 1199 transitions. [2018-06-22 11:12:54,527 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:54,528 INFO ]: Found error trace [2018-06-22 11:12:54,529 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:54,529 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:54,529 INFO ]: Analyzing trace with hash 927805434, now seen corresponding path program 1 times [2018-06-22 11:12:54,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:54,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:54,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:54,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:54,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:54,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:54,668 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:12:54,669 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:54,669 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:54,669 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:54,669 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:54,669 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:54,669 INFO ]: Start difference. First operand 213 states and 1199 transitions. Second operand 4 states. [2018-06-22 11:12:55,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:55,133 INFO ]: Finished difference Result 239 states and 1191 transitions. [2018-06-22 11:12:55,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:55,133 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:55,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:55,138 INFO ]: With dead ends: 239 [2018-06-22 11:12:55,138 INFO ]: Without dead ends: 239 [2018-06-22 11:12:55,138 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:55,138 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-22 11:12:55,174 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 213. [2018-06-22 11:12:55,174 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-22 11:12:55,183 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1100 transitions. [2018-06-22 11:12:55,183 INFO ]: Start accepts. Automaton has 213 states and 1100 transitions. Word has length 17 [2018-06-22 11:12:55,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:55,183 INFO ]: Abstraction has 213 states and 1100 transitions. [2018-06-22 11:12:55,183 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:55,183 INFO ]: Start isEmpty. Operand 213 states and 1100 transitions. [2018-06-22 11:12:55,189 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:55,189 INFO ]: Found error trace [2018-06-22 11:12:55,189 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:55,189 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:55,189 INFO ]: Analyzing trace with hash -1620898105, now seen corresponding path program 1 times [2018-06-22 11:12:55,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:55,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:55,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:55,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:55,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:55,194 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:55,544 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:12:55,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:55,677 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:12:55,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:55,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:55,696 INFO ]: Computing forward predicates... [2018-06-22 11:12:55,739 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:12:55,758 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:55,758 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2018-06-22 11:12:55,759 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:12:55,759 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:12:55,759 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:12:55,759 INFO ]: Start difference. First operand 213 states and 1100 transitions. Second operand 6 states. [2018-06-22 11:12:57,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:57,531 INFO ]: Finished difference Result 275 states and 1327 transitions. [2018-06-22 11:12:57,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:57,532 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:12:57,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:57,540 INFO ]: With dead ends: 275 [2018-06-22 11:12:57,540 INFO ]: Without dead ends: 249 [2018-06-22 11:12:57,540 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:12:57,540 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 11:12:57,575 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 187. [2018-06-22 11:12:57,575 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-22 11:12:57,579 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 854 transitions. [2018-06-22 11:12:57,579 INFO ]: Start accepts. Automaton has 187 states and 854 transitions. Word has length 17 [2018-06-22 11:12:57,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:57,579 INFO ]: Abstraction has 187 states and 854 transitions. [2018-06-22 11:12:57,579 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:12:57,579 INFO ]: Start isEmpty. Operand 187 states and 854 transitions. [2018-06-22 11:12:57,585 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:57,586 INFO ]: Found error trace [2018-06-22 11:12:57,586 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:57,586 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:57,586 INFO ]: Analyzing trace with hash 1583343974, now seen corresponding path program 1 times [2018-06-22 11:12:57,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:57,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:57,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:57,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:57,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:57,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:57,807 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:12:57,855 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:12:57,855 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:57,855 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:57,855 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:57,855 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:57,855 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:57,856 INFO ]: Start difference. First operand 187 states and 854 transitions. Second operand 4 states. [2018-06-22 11:12:58,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:58,080 INFO ]: Finished difference Result 221 states and 808 transitions. [2018-06-22 11:12:58,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:58,080 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:58,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:58,084 INFO ]: With dead ends: 221 [2018-06-22 11:12:58,084 INFO ]: Without dead ends: 189 [2018-06-22 11:12:58,084 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:12:58,085 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-22 11:12:58,109 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-06-22 11:12:58,109 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 11:12:58,111 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 522 transitions. [2018-06-22 11:12:58,111 INFO ]: Start accepts. Automaton has 145 states and 522 transitions. Word has length 17 [2018-06-22 11:12:58,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:58,111 INFO ]: Abstraction has 145 states and 522 transitions. [2018-06-22 11:12:58,111 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:58,111 INFO ]: Start isEmpty. Operand 145 states and 522 transitions. [2018-06-22 11:12:58,114 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:58,114 INFO ]: Found error trace [2018-06-22 11:12:58,114 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:58,114 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:58,114 INFO ]: Analyzing trace with hash 390505499, now seen corresponding path program 1 times [2018-06-22 11:12:58,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:58,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:58,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:58,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:58,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:58,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:58,261 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:12:58,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:58,261 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:58,261 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:58,261 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:58,261 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:58,261 INFO ]: Start difference. First operand 145 states and 522 transitions. Second operand 4 states. [2018-06-22 11:12:58,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:58,930 INFO ]: Finished difference Result 161 states and 540 transitions. [2018-06-22 11:12:58,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:58,930 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:58,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:58,932 INFO ]: With dead ends: 161 [2018-06-22 11:12:58,932 INFO ]: Without dead ends: 161 [2018-06-22 11:12:58,932 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:58,933 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 11:12:58,943 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 145. [2018-06-22 11:12:58,943 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 11:12:58,944 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 516 transitions. [2018-06-22 11:12:58,944 INFO ]: Start accepts. Automaton has 145 states and 516 transitions. Word has length 17 [2018-06-22 11:12:58,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:58,945 INFO ]: Abstraction has 145 states and 516 transitions. [2018-06-22 11:12:58,945 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:58,945 INFO ]: Start isEmpty. Operand 145 states and 516 transitions. [2018-06-22 11:12:58,948 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:58,948 INFO ]: Found error trace [2018-06-22 11:12:58,948 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:58,948 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:58,948 INFO ]: Analyzing trace with hash 719317309, now seen corresponding path program 1 times [2018-06-22 11:12:58,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:58,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:58,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:58,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:58,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:58,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:59,081 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:12:59,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:59,082 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:59,082 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:59,082 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:59,082 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:59,082 INFO ]: Start difference. First operand 145 states and 516 transitions. Second operand 4 states. [2018-06-22 11:12:59,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:59,481 INFO ]: Finished difference Result 172 states and 594 transitions. [2018-06-22 11:12:59,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:59,481 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:59,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:59,483 INFO ]: With dead ends: 172 [2018-06-22 11:12:59,483 INFO ]: Without dead ends: 161 [2018-06-22 11:12:59,483 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:12:59,484 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 11:12:59,497 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 151. [2018-06-22 11:12:59,497 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:12:59,498 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 522 transitions. [2018-06-22 11:12:59,499 INFO ]: Start accepts. Automaton has 151 states and 522 transitions. Word has length 17 [2018-06-22 11:12:59,499 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:59,499 INFO ]: Abstraction has 151 states and 522 transitions. [2018-06-22 11:12:59,499 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:59,499 INFO ]: Start isEmpty. Operand 151 states and 522 transitions. [2018-06-22 11:12:59,501 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:59,501 INFO ]: Found error trace [2018-06-22 11:12:59,502 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:59,502 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:59,502 INFO ]: Analyzing trace with hash 1772948120, now seen corresponding path program 1 times [2018-06-22 11:12:59,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:59,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:59,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:59,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:59,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:59,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:59,738 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:59,738 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:59,738 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:12:59,738 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:12:59,738 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:12:59,738 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:59,738 INFO ]: Start difference. First operand 151 states and 522 transitions. Second operand 5 states. [2018-06-22 11:13:00,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:00,218 INFO ]: Finished difference Result 189 states and 621 transitions. [2018-06-22 11:13:00,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:00,218 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:00,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:00,220 INFO ]: With dead ends: 189 [2018-06-22 11:13:00,220 INFO ]: Without dead ends: 189 [2018-06-22 11:13:00,220 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:00,221 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-22 11:13:00,232 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 151. [2018-06-22 11:13:00,232 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:13:00,234 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 521 transitions. [2018-06-22 11:13:00,234 INFO ]: Start accepts. Automaton has 151 states and 521 transitions. Word has length 17 [2018-06-22 11:13:00,234 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:00,234 INFO ]: Abstraction has 151 states and 521 transitions. [2018-06-22 11:13:00,234 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:00,234 INFO ]: Start isEmpty. Operand 151 states and 521 transitions. [2018-06-22 11:13:00,239 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:00,239 INFO ]: Found error trace [2018-06-22 11:13:00,239 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:00,239 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:00,239 INFO ]: Analyzing trace with hash -193667500, now seen corresponding path program 1 times [2018-06-22 11:13:00,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:00,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:00,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:00,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:00,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:00,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:00,373 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:00,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:00,373 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:00,373 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:00,373 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:00,373 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:00,373 INFO ]: Start difference. First operand 151 states and 521 transitions. Second operand 5 states. [2018-06-22 11:13:00,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:00,984 INFO ]: Finished difference Result 177 states and 585 transitions. [2018-06-22 11:13:00,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:00,985 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:00,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:00,987 INFO ]: With dead ends: 177 [2018-06-22 11:13:00,987 INFO ]: Without dead ends: 177 [2018-06-22 11:13:00,987 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:00,987 INFO ]: Start minimizeSevpa. Operand 177 states. [2018-06-22 11:13:00,997 INFO ]: Finished minimizeSevpa. Reduced states from 177 to 151. [2018-06-22 11:13:00,997 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:13:00,998 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 520 transitions. [2018-06-22 11:13:00,999 INFO ]: Start accepts. Automaton has 151 states and 520 transitions. Word has length 17 [2018-06-22 11:13:00,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:00,999 INFO ]: Abstraction has 151 states and 520 transitions. [2018-06-22 11:13:00,999 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:00,999 INFO ]: Start isEmpty. Operand 151 states and 520 transitions. [2018-06-22 11:13:01,002 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:01,002 INFO ]: Found error trace [2018-06-22 11:13:01,002 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:01,002 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:01,002 INFO ]: Analyzing trace with hash 970508338, now seen corresponding path program 1 times [2018-06-22 11:13:01,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:01,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:01,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:01,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:01,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:01,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:01,115 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:01,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:01,115 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:01,115 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:01,115 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:01,115 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:01,115 INFO ]: Start difference. First operand 151 states and 520 transitions. Second operand 5 states. [2018-06-22 11:13:01,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:01,469 INFO ]: Finished difference Result 195 states and 642 transitions. [2018-06-22 11:13:01,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:01,470 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:01,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:01,472 INFO ]: With dead ends: 195 [2018-06-22 11:13:01,472 INFO ]: Without dead ends: 195 [2018-06-22 11:13:01,472 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:01,472 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 11:13:01,484 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 151. [2018-06-22 11:13:01,484 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:13:01,487 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 519 transitions. [2018-06-22 11:13:01,487 INFO ]: Start accepts. Automaton has 151 states and 519 transitions. Word has length 17 [2018-06-22 11:13:01,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:01,487 INFO ]: Abstraction has 151 states and 519 transitions. [2018-06-22 11:13:01,487 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:01,487 INFO ]: Start isEmpty. Operand 151 states and 519 transitions. [2018-06-22 11:13:01,490 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:01,490 INFO ]: Found error trace [2018-06-22 11:13:01,490 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:01,490 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:01,490 INFO ]: Analyzing trace with hash -1957762998, now seen corresponding path program 1 times [2018-06-22 11:13:01,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:01,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:01,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:01,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:01,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:01,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:01,737 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:01,737 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:01,737 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:01,738 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:01,738 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:01,738 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:01,738 INFO ]: Start difference. First operand 151 states and 519 transitions. Second operand 5 states. [2018-06-22 11:13:02,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:02,419 INFO ]: Finished difference Result 167 states and 530 transitions. [2018-06-22 11:13:02,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:02,419 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:02,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:02,421 INFO ]: With dead ends: 167 [2018-06-22 11:13:02,421 INFO ]: Without dead ends: 152 [2018-06-22 11:13:02,421 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:02,422 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 11:13:02,431 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 130. [2018-06-22 11:13:02,431 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 11:13:02,432 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 414 transitions. [2018-06-22 11:13:02,432 INFO ]: Start accepts. Automaton has 130 states and 414 transitions. Word has length 17 [2018-06-22 11:13:02,432 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:02,432 INFO ]: Abstraction has 130 states and 414 transitions. [2018-06-22 11:13:02,432 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:02,432 INFO ]: Start isEmpty. Operand 130 states and 414 transitions. [2018-06-22 11:13:02,434 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:02,434 INFO ]: Found error trace [2018-06-22 11:13:02,434 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:02,434 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:02,435 INFO ]: Analyzing trace with hash -2013381878, now seen corresponding path program 1 times [2018-06-22 11:13:02,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:02,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:02,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:02,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:02,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:02,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:02,594 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:02,594 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:02,594 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:02,594 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:02,595 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:02,595 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:02,595 INFO ]: Start difference. First operand 130 states and 414 transitions. Second operand 5 states. [2018-06-22 11:13:03,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:03,049 INFO ]: Finished difference Result 200 states and 642 transitions. [2018-06-22 11:13:03,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:03,049 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:03,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:03,051 INFO ]: With dead ends: 200 [2018-06-22 11:13:03,051 INFO ]: Without dead ends: 168 [2018-06-22 11:13:03,051 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:03,051 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:13:03,060 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 138. [2018-06-22 11:13:03,060 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:13:03,061 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 438 transitions. [2018-06-22 11:13:03,061 INFO ]: Start accepts. Automaton has 138 states and 438 transitions. Word has length 17 [2018-06-22 11:13:03,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:03,061 INFO ]: Abstraction has 138 states and 438 transitions. [2018-06-22 11:13:03,061 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:03,061 INFO ]: Start isEmpty. Operand 138 states and 438 transitions. [2018-06-22 11:13:03,064 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:03,064 INFO ]: Found error trace [2018-06-22 11:13:03,064 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:03,064 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:03,064 INFO ]: Analyzing trace with hash 674360937, now seen corresponding path program 1 times [2018-06-22 11:13:03,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:03,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:03,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:03,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:03,084 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:03,085 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:03,085 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:03,085 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:03,085 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:03,085 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:03,085 INFO ]: Start difference. First operand 138 states and 438 transitions. Second operand 4 states. [2018-06-22 11:13:03,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:03,377 INFO ]: Finished difference Result 154 states and 475 transitions. [2018-06-22 11:13:03,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:03,378 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:03,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:03,380 INFO ]: With dead ends: 154 [2018-06-22 11:13:03,380 INFO ]: Without dead ends: 154 [2018-06-22 11:13:03,381 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:13:03,381 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 11:13:03,390 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 138. [2018-06-22 11:13:03,390 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:13:03,391 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 432 transitions. [2018-06-22 11:13:03,391 INFO ]: Start accepts. Automaton has 138 states and 432 transitions. Word has length 17 [2018-06-22 11:13:03,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:03,391 INFO ]: Abstraction has 138 states and 432 transitions. [2018-06-22 11:13:03,391 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:03,391 INFO ]: Start isEmpty. Operand 138 states and 432 transitions. [2018-06-22 11:13:03,393 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:03,394 INFO ]: Found error trace [2018-06-22 11:13:03,394 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:03,395 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:03,395 INFO ]: Analyzing trace with hash 1207322324, now seen corresponding path program 1 times [2018-06-22 11:13:03,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:03,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:03,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:03,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:03,484 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:03,485 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:03,485 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:03,485 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:03,485 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:03,485 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:03,485 INFO ]: Start difference. First operand 138 states and 432 transitions. Second operand 4 states. [2018-06-22 11:13:03,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:03,589 INFO ]: Finished difference Result 154 states and 467 transitions. [2018-06-22 11:13:03,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:03,589 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:03,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:03,591 INFO ]: With dead ends: 154 [2018-06-22 11:13:03,591 INFO ]: Without dead ends: 148 [2018-06-22 11:13:03,591 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:13:03,591 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 11:13:03,599 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 134. [2018-06-22 11:13:03,599 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 11:13:03,600 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 424 transitions. [2018-06-22 11:13:03,600 INFO ]: Start accepts. Automaton has 134 states and 424 transitions. Word has length 17 [2018-06-22 11:13:03,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:03,601 INFO ]: Abstraction has 134 states and 424 transitions. [2018-06-22 11:13:03,601 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:03,601 INFO ]: Start isEmpty. Operand 134 states and 424 transitions. [2018-06-22 11:13:03,603 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:03,603 INFO ]: Found error trace [2018-06-22 11:13:03,603 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:03,603 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:03,603 INFO ]: Analyzing trace with hash -628854177, now seen corresponding path program 1 times [2018-06-22 11:13:03,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:03,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:03,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:03,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:03,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:03,841 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:03,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:03,841 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:03,841 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:03,841 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:03,841 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:03,841 INFO ]: Start difference. First operand 134 states and 424 transitions. Second operand 5 states. [2018-06-22 11:13:04,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:04,109 INFO ]: Finished difference Result 154 states and 454 transitions. [2018-06-22 11:13:04,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:04,109 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:04,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:04,111 INFO ]: With dead ends: 154 [2018-06-22 11:13:04,111 INFO ]: Without dead ends: 150 [2018-06-22 11:13:04,111 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:04,111 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:13:04,119 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 128. [2018-06-22 11:13:04,120 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 11:13:04,121 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 390 transitions. [2018-06-22 11:13:04,121 INFO ]: Start accepts. Automaton has 128 states and 390 transitions. Word has length 17 [2018-06-22 11:13:04,121 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:04,121 INFO ]: Abstraction has 128 states and 390 transitions. [2018-06-22 11:13:04,121 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:04,121 INFO ]: Start isEmpty. Operand 128 states and 390 transitions. [2018-06-22 11:13:04,125 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:04,125 INFO ]: Found error trace [2018-06-22 11:13:04,125 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:04,125 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:04,126 INFO ]: Analyzing trace with hash -1939931257, now seen corresponding path program 1 times [2018-06-22 11:13:04,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:04,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:04,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:04,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:04,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:04,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:04,338 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:13:04,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:04,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:04,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:04,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:04,361 INFO ]: Computing forward predicates... [2018-06-22 11:13:04,410 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:13:04,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:04,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:13:04,441 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:13:04,441 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:13:04,442 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:13:04,442 INFO ]: Start difference. First operand 128 states and 390 transitions. Second operand 11 states. [2018-06-22 11:13:04,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:04,857 INFO ]: Finished difference Result 186 states and 560 transitions. [2018-06-22 11:13:04,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:13:04,857 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:13:04,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:04,858 INFO ]: With dead ends: 186 [2018-06-22 11:13:04,858 INFO ]: Without dead ends: 186 [2018-06-22 11:13:04,859 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:04,859 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 11:13:04,865 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 132. [2018-06-22 11:13:04,865 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-22 11:13:04,866 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 419 transitions. [2018-06-22 11:13:04,866 INFO ]: Start accepts. Automaton has 132 states and 419 transitions. Word has length 17 [2018-06-22 11:13:04,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:04,866 INFO ]: Abstraction has 132 states and 419 transitions. [2018-06-22 11:13:04,866 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:13:04,866 INFO ]: Start isEmpty. Operand 132 states and 419 transitions. [2018-06-22 11:13:04,868 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:04,868 INFO ]: Found error trace [2018-06-22 11:13:04,868 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:04,868 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:04,868 INFO ]: Analyzing trace with hash 1190860201, now seen corresponding path program 1 times [2018-06-22 11:13:04,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:04,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:04,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:04,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:04,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:04,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:04,953 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:04,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:04,953 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:04,953 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:04,953 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:04,953 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:04,953 INFO ]: Start difference. First operand 132 states and 419 transitions. Second operand 5 states. [2018-06-22 11:13:05,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:05,577 INFO ]: Finished difference Result 154 states and 466 transitions. [2018-06-22 11:13:05,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:05,577 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:05,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:05,578 INFO ]: With dead ends: 154 [2018-06-22 11:13:05,578 INFO ]: Without dead ends: 153 [2018-06-22 11:13:05,579 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:05,579 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-22 11:13:05,586 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 131. [2018-06-22 11:13:05,586 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:13:05,588 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 409 transitions. [2018-06-22 11:13:05,588 INFO ]: Start accepts. Automaton has 131 states and 409 transitions. Word has length 17 [2018-06-22 11:13:05,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:05,588 INFO ]: Abstraction has 131 states and 409 transitions. [2018-06-22 11:13:05,588 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:05,588 INFO ]: Start isEmpty. Operand 131 states and 409 transitions. [2018-06-22 11:13:05,590 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:05,590 INFO ]: Found error trace [2018-06-22 11:13:05,590 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:05,590 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:05,590 INFO ]: Analyzing trace with hash 535321661, now seen corresponding path program 1 times [2018-06-22 11:13:05,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:05,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:05,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:05,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:05,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:05,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:05,686 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:05,687 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:05,687 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:05,687 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:05,687 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:05,687 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:05,687 INFO ]: Start difference. First operand 131 states and 409 transitions. Second operand 5 states. [2018-06-22 11:13:05,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:05,897 INFO ]: Finished difference Result 157 states and 456 transitions. [2018-06-22 11:13:05,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:05,897 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:05,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:05,899 INFO ]: With dead ends: 157 [2018-06-22 11:13:05,899 INFO ]: Without dead ends: 157 [2018-06-22 11:13:05,899 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:05,899 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 11:13:05,906 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 135. [2018-06-22 11:13:05,906 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:13:05,907 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 419 transitions. [2018-06-22 11:13:05,907 INFO ]: Start accepts. Automaton has 135 states and 419 transitions. Word has length 17 [2018-06-22 11:13:05,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:05,908 INFO ]: Abstraction has 135 states and 419 transitions. [2018-06-22 11:13:05,908 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:05,908 INFO ]: Start isEmpty. Operand 135 states and 419 transitions. [2018-06-22 11:13:05,910 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:05,910 INFO ]: Found error trace [2018-06-22 11:13:05,911 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:05,911 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:05,911 INFO ]: Analyzing trace with hash 1626046878, now seen corresponding path program 1 times [2018-06-22 11:13:05,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:05,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:05,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:05,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:05,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:05,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:06,085 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:06,085 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:06,112 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:06,112 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:06,112 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:06,112 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:06,112 INFO ]: Start difference. First operand 135 states and 419 transitions. Second operand 5 states. [2018-06-22 11:13:06,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:06,391 INFO ]: Finished difference Result 163 states and 491 transitions. [2018-06-22 11:13:06,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:06,391 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:06,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:06,393 INFO ]: With dead ends: 163 [2018-06-22 11:13:06,393 INFO ]: Without dead ends: 163 [2018-06-22 11:13:06,393 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:06,393 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 11:13:06,399 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 135. [2018-06-22 11:13:06,399 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:13:06,400 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 417 transitions. [2018-06-22 11:13:06,400 INFO ]: Start accepts. Automaton has 135 states and 417 transitions. Word has length 17 [2018-06-22 11:13:06,400 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:06,400 INFO ]: Abstraction has 135 states and 417 transitions. [2018-06-22 11:13:06,400 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:06,400 INFO ]: Start isEmpty. Operand 135 states and 417 transitions. [2018-06-22 11:13:06,402 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:06,402 INFO ]: Found error trace [2018-06-22 11:13:06,402 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:06,402 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:06,402 INFO ]: Analyzing trace with hash 1755116379, now seen corresponding path program 2 times [2018-06-22 11:13:06,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:06,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:06,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:06,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:06,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:06,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:06,750 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:13:07,006 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:13:07,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:07,006 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:13:07,012 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:07,040 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:07,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:07,042 INFO ]: Computing forward predicates... [2018-06-22 11:13:07,088 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:13:07,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:07,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:13:07,108 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:13:07,108 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:13:07,108 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:13:07,108 INFO ]: Start difference. First operand 135 states and 417 transitions. Second operand 11 states. [2018-06-22 11:13:07,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:07,540 INFO ]: Finished difference Result 185 states and 542 transitions. [2018-06-22 11:13:07,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:13:07,541 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:13:07,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:07,542 INFO ]: With dead ends: 185 [2018-06-22 11:13:07,542 INFO ]: Without dead ends: 185 [2018-06-22 11:13:07,543 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:07,543 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-22 11:13:07,549 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 135. [2018-06-22 11:13:07,549 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:13:07,550 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 417 transitions. [2018-06-22 11:13:07,550 INFO ]: Start accepts. Automaton has 135 states and 417 transitions. Word has length 17 [2018-06-22 11:13:07,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:07,550 INFO ]: Abstraction has 135 states and 417 transitions. [2018-06-22 11:13:07,550 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:13:07,550 INFO ]: Start isEmpty. Operand 135 states and 417 transitions. [2018-06-22 11:13:07,552 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:07,552 INFO ]: Found error trace [2018-06-22 11:13:07,552 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:07,552 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:07,552 INFO ]: Analyzing trace with hash -849206040, now seen corresponding path program 1 times [2018-06-22 11:13:07,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:07,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:07,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:07,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:07,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:07,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:07,791 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:07,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:07,791 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:07,791 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:07,791 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:07,791 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:07,791 INFO ]: Start difference. First operand 135 states and 417 transitions. Second operand 5 states. [2018-06-22 11:13:08,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:08,306 INFO ]: Finished difference Result 155 states and 446 transitions. [2018-06-22 11:13:08,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:08,306 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:08,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:08,307 INFO ]: With dead ends: 155 [2018-06-22 11:13:08,307 INFO ]: Without dead ends: 150 [2018-06-22 11:13:08,307 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:08,308 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:13:08,315 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-06-22 11:13:08,315 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 11:13:08,316 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 373 transitions. [2018-06-22 11:13:08,316 INFO ]: Start accepts. Automaton has 126 states and 373 transitions. Word has length 17 [2018-06-22 11:13:08,316 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:08,316 INFO ]: Abstraction has 126 states and 373 transitions. [2018-06-22 11:13:08,316 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:08,316 INFO ]: Start isEmpty. Operand 126 states and 373 transitions. [2018-06-22 11:13:08,318 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:08,318 INFO ]: Found error trace [2018-06-22 11:13:08,318 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:08,318 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:08,318 INFO ]: Analyzing trace with hash -1357843338, now seen corresponding path program 1 times [2018-06-22 11:13:08,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:08,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:08,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:08,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:08,465 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:08,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:08,465 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:08,465 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:08,465 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:08,465 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:08,465 INFO ]: Start difference. First operand 126 states and 373 transitions. Second operand 5 states. [2018-06-22 11:13:08,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:08,664 INFO ]: Finished difference Result 144 states and 393 transitions. [2018-06-22 11:13:08,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:08,665 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:08,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:08,666 INFO ]: With dead ends: 144 [2018-06-22 11:13:08,666 INFO ]: Without dead ends: 133 [2018-06-22 11:13:08,666 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:08,666 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 11:13:08,671 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-06-22 11:13:08,671 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:13:08,672 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 296 transitions. [2018-06-22 11:13:08,672 INFO ]: Start accepts. Automaton has 109 states and 296 transitions. Word has length 17 [2018-06-22 11:13:08,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:08,672 INFO ]: Abstraction has 109 states and 296 transitions. [2018-06-22 11:13:08,672 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:08,672 INFO ]: Start isEmpty. Operand 109 states and 296 transitions. [2018-06-22 11:13:08,674 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:08,674 INFO ]: Found error trace [2018-06-22 11:13:08,674 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:08,674 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:08,674 INFO ]: Analyzing trace with hash -775755419, now seen corresponding path program 1 times [2018-06-22 11:13:08,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:08,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:08,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:08,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:08,750 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:13:08,750 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:08,750 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:08,750 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:08,750 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:08,750 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:08,750 INFO ]: Start difference. First operand 109 states and 296 transitions. Second operand 5 states. [2018-06-22 11:13:08,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:08,909 INFO ]: Finished difference Result 133 states and 333 transitions. [2018-06-22 11:13:08,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:08,909 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:13:08,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:08,910 INFO ]: With dead ends: 133 [2018-06-22 11:13:08,910 INFO ]: Without dead ends: 133 [2018-06-22 11:13:08,910 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:08,910 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 11:13:08,916 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-06-22 11:13:08,916 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:13:08,916 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 295 transitions. [2018-06-22 11:13:08,917 INFO ]: Start accepts. Automaton has 109 states and 295 transitions. Word has length 17 [2018-06-22 11:13:08,917 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:08,917 INFO ]: Abstraction has 109 states and 295 transitions. [2018-06-22 11:13:08,917 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:08,917 INFO ]: Start isEmpty. Operand 109 states and 295 transitions. [2018-06-22 11:13:08,918 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:08,918 INFO ]: Found error trace [2018-06-22 11:13:08,918 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:08,918 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:08,918 INFO ]: Analyzing trace with hash 1699497499, now seen corresponding path program 2 times [2018-06-22 11:13:08,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:08,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:08,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:08,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:08,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:09,655 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:13:09,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:09,655 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:13:09,670 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:09,724 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:09,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:09,726 INFO ]: Computing forward predicates... [2018-06-22 11:13:10,401 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:13:10,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:10,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:13:10,423 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:13:10,424 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:13:10,424 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:13:10,424 INFO ]: Start difference. First operand 109 states and 295 transitions. Second operand 11 states. [2018-06-22 11:13:10,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:10,666 INFO ]: Finished difference Result 161 states and 415 transitions. [2018-06-22 11:13:10,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:13:10,667 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:13:10,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:10,668 INFO ]: With dead ends: 161 [2018-06-22 11:13:10,668 INFO ]: Without dead ends: 161 [2018-06-22 11:13:10,668 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:10,668 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 11:13:10,675 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 107. [2018-06-22 11:13:10,675 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:13:10,675 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 293 transitions. [2018-06-22 11:13:10,675 INFO ]: Start accepts. Automaton has 107 states and 293 transitions. Word has length 17 [2018-06-22 11:13:10,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:10,676 INFO ]: Abstraction has 107 states and 293 transitions. [2018-06-22 11:13:10,676 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:13:10,676 INFO ]: Start isEmpty. Operand 107 states and 293 transitions. [2018-06-22 11:13:10,677 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:10,677 INFO ]: Found error trace [2018-06-22 11:13:10,677 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:10,677 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:10,677 INFO ]: Analyzing trace with hash -1431293959, now seen corresponding path program 1 times [2018-06-22 11:13:10,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:10,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:10,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:10,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:10,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:10,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:11,095 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:13:11,345 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:13:11,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:11,345 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:13:11,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:11,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:11,373 INFO ]: Computing forward predicates... [2018-06-22 11:13:11,414 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:13:11,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:11,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:13:11,433 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:13:11,433 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:13:11,433 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:13:11,433 INFO ]: Start difference. First operand 107 states and 293 transitions. Second operand 11 states. [2018-06-22 11:13:11,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:11,700 INFO ]: Finished difference Result 151 states and 391 transitions. [2018-06-22 11:13:11,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:13:11,700 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:13:11,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:11,701 INFO ]: With dead ends: 151 [2018-06-22 11:13:11,701 INFO ]: Without dead ends: 151 [2018-06-22 11:13:11,701 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:11,701 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-22 11:13:11,706 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 111. [2018-06-22 11:13:11,706 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-22 11:13:11,707 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 299 transitions. [2018-06-22 11:13:11,707 INFO ]: Start accepts. Automaton has 111 states and 299 transitions. Word has length 17 [2018-06-22 11:13:11,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:11,707 INFO ]: Abstraction has 111 states and 299 transitions. [2018-06-22 11:13:11,707 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:13:11,707 INFO ]: Start isEmpty. Operand 111 states and 299 transitions. [2018-06-22 11:13:11,708 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:11,708 INFO ]: Found error trace [2018-06-22 11:13:11,708 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:13:11,709 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:11,709 INFO ]: Analyzing trace with hash 2049788250, now seen corresponding path program 1 times [2018-06-22 11:13:11,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:11,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:11,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:11,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:11,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:11,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:11,837 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:11,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:11,838 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:11,838 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:11,838 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:11,838 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:11,838 INFO ]: Start difference. First operand 111 states and 299 transitions. Second operand 4 states. [2018-06-22 11:13:11,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:11,928 INFO ]: Finished difference Result 119 states and 251 transitions. [2018-06-22 11:13:11,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:13:11,928 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:13:11,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:11,929 INFO ]: With dead ends: 119 [2018-06-22 11:13:11,929 INFO ]: Without dead ends: 103 [2018-06-22 11:13:11,929 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:11,929 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:13:11,932 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 79. [2018-06-22 11:13:11,932 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:13:11,932 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 167 transitions. [2018-06-22 11:13:11,932 INFO ]: Start accepts. Automaton has 79 states and 167 transitions. Word has length 21 [2018-06-22 11:13:11,932 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:11,932 INFO ]: Abstraction has 79 states and 167 transitions. [2018-06-22 11:13:11,932 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:11,933 INFO ]: Start isEmpty. Operand 79 states and 167 transitions. [2018-06-22 11:13:11,933 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:11,933 INFO ]: Found error trace [2018-06-22 11:13:11,933 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:13:11,933 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:11,933 INFO ]: Analyzing trace with hash 1901787408, now seen corresponding path program 1 times [2018-06-22 11:13:11,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:11,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:11,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:11,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:11,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:11,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:11,995 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:11,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:11,995 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:11,995 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:11,995 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:11,995 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:11,995 INFO ]: Start difference. First operand 79 states and 167 transitions. Second operand 4 states. [2018-06-22 11:13:12,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:12,056 INFO ]: Finished difference Result 97 states and 187 transitions. [2018-06-22 11:13:12,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:13:12,057 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:13:12,057 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:12,057 INFO ]: With dead ends: 97 [2018-06-22 11:13:12,057 INFO ]: Without dead ends: 85 [2018-06-22 11:13:12,058 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:13:12,058 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:13:12,060 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-06-22 11:13:12,060 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:13:12,060 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 144 transitions. [2018-06-22 11:13:12,061 INFO ]: Start accepts. Automaton has 71 states and 144 transitions. Word has length 21 [2018-06-22 11:13:12,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:12,061 INFO ]: Abstraction has 71 states and 144 transitions. [2018-06-22 11:13:12,061 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:12,061 INFO ]: Start isEmpty. Operand 71 states and 144 transitions. [2018-06-22 11:13:12,062 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:12,062 INFO ]: Found error trace [2018-06-22 11:13:12,062 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:13:12,062 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:12,062 INFO ]: Analyzing trace with hash -83501852, now seen corresponding path program 1 times [2018-06-22 11:13:12,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:12,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:12,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:12,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:12,129 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:12,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:12,130 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:12,130 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:12,130 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:12,130 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:12,130 INFO ]: Start difference. First operand 71 states and 144 transitions. Second operand 4 states. [2018-06-22 11:13:12,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:12,225 INFO ]: Finished difference Result 89 states and 168 transitions. [2018-06-22 11:13:12,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:13:12,226 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:13:12,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:12,226 INFO ]: With dead ends: 89 [2018-06-22 11:13:12,226 INFO ]: Without dead ends: 82 [2018-06-22 11:13:12,226 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:13:12,226 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:13:12,228 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-06-22 11:13:12,228 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:13:12,228 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 131 transitions. [2018-06-22 11:13:12,228 INFO ]: Start accepts. Automaton has 66 states and 131 transitions. Word has length 21 [2018-06-22 11:13:12,229 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:12,229 INFO ]: Abstraction has 66 states and 131 transitions. [2018-06-22 11:13:12,229 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:12,229 INFO ]: Start isEmpty. Operand 66 states and 131 transitions. [2018-06-22 11:13:12,229 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:12,229 INFO ]: Found error trace [2018-06-22 11:13:12,229 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:13:12,229 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:12,230 INFO ]: Analyzing trace with hash -1247577180, now seen corresponding path program 1 times [2018-06-22 11:13:12,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:12,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:12,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:12,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:12,371 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:12,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:12,372 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:12,372 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:12,372 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:12,372 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:12,372 INFO ]: Start difference. First operand 66 states and 131 transitions. Second operand 4 states. [2018-06-22 11:13:12,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:12,941 INFO ]: Finished difference Result 76 states and 141 transitions. [2018-06-22 11:13:12,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:13:12,941 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:13:12,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:12,941 INFO ]: With dead ends: 76 [2018-06-22 11:13:12,941 INFO ]: Without dead ends: 69 [2018-06-22 11:13:12,942 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:12,942 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:13:12,943 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-06-22 11:13:12,943 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:13:12,943 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 111 transitions. [2018-06-22 11:13:12,943 INFO ]: Start accepts. Automaton has 57 states and 111 transitions. Word has length 21 [2018-06-22 11:13:12,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:12,943 INFO ]: Abstraction has 57 states and 111 transitions. [2018-06-22 11:13:12,943 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:12,943 INFO ]: Start isEmpty. Operand 57 states and 111 transitions. [2018-06-22 11:13:12,944 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:12,944 INFO ]: Found error trace [2018-06-22 11:13:12,944 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:13:12,944 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:12,944 INFO ]: Analyzing trace with hash -1946596221, now seen corresponding path program 1 times [2018-06-22 11:13:12,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:12,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:12,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:12,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:12,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:13,016 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:13:13,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:13,016 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:13,017 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:13,017 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:13,017 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:13,017 INFO ]: Start difference. First operand 57 states and 111 transitions. Second operand 5 states. [2018-06-22 11:13:13,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:13,063 INFO ]: Finished difference Result 59 states and 112 transitions. [2018-06-22 11:13:13,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:13,063 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:13:13,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:13,064 INFO ]: With dead ends: 59 [2018-06-22 11:13:13,064 INFO ]: Without dead ends: 54 [2018-06-22 11:13:13,064 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:13,064 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:13:13,065 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 11:13:13,065 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:13:13,066 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2018-06-22 11:13:13,066 INFO ]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 21 [2018-06-22 11:13:13,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:13,066 INFO ]: Abstraction has 52 states and 95 transitions. [2018-06-22 11:13:13,066 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:13,066 INFO ]: Start isEmpty. Operand 52 states and 95 transitions. [2018-06-22 11:13:13,066 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:13,066 INFO ]: Found error trace [2018-06-22 11:13:13,066 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:13:13,066 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:13,066 INFO ]: Analyzing trace with hash -1424459804, now seen corresponding path program 1 times [2018-06-22 11:13:13,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:13,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:13,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:13,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,073 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:13,118 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:13:13,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:13,118 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:13,118 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:13,118 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:13,118 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:13,118 INFO ]: Start difference. First operand 52 states and 95 transitions. Second operand 5 states. [2018-06-22 11:13:13,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:13,165 INFO ]: Finished difference Result 54 states and 96 transitions. [2018-06-22 11:13:13,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:13,166 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:13:13,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:13,166 INFO ]: With dead ends: 54 [2018-06-22 11:13:13,166 INFO ]: Without dead ends: 49 [2018-06-22 11:13:13,166 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:13,166 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:13:13,167 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:13:13,167 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:13:13,167 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-06-22 11:13:13,167 INFO ]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 21 [2018-06-22 11:13:13,167 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:13,167 INFO ]: Abstraction has 47 states and 79 transitions. [2018-06-22 11:13:13,167 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:13,167 INFO ]: Start isEmpty. Operand 47 states and 79 transitions. [2018-06-22 11:13:13,168 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:13,168 INFO ]: Found error trace [2018-06-22 11:13:13,168 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:13:13,168 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:13,168 INFO ]: Analyzing trace with hash -153114416, now seen corresponding path program 1 times [2018-06-22 11:13:13,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:13,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:13,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:13,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:13,400 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:13:13,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:13,400 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:13,400 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:13,400 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:13,400 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:13,400 INFO ]: Start difference. First operand 47 states and 79 transitions. Second operand 5 states. [2018-06-22 11:13:13,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:13,600 INFO ]: Finished difference Result 49 states and 80 transitions. [2018-06-22 11:13:13,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:13,600 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:13:13,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:13,601 INFO ]: With dead ends: 49 [2018-06-22 11:13:13,601 INFO ]: Without dead ends: 44 [2018-06-22 11:13:13,601 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:13,601 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:13:13,604 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 11:13:13,604 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:13:13,604 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2018-06-22 11:13:13,604 INFO ]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 21 [2018-06-22 11:13:13,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:13,604 INFO ]: Abstraction has 40 states and 60 transitions. [2018-06-22 11:13:13,604 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:13,604 INFO ]: Start isEmpty. Operand 40 states and 60 transitions. [2018-06-22 11:13:13,608 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:13,608 INFO ]: Found error trace [2018-06-22 11:13:13,608 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:13:13,608 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:13,608 INFO ]: Analyzing trace with hash -515718705, now seen corresponding path program 1 times [2018-06-22 11:13:13,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:13,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:13,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:13,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:13,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:13,837 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:13:13,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:13,837 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:13:13,837 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:13:13,837 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:13:13,837 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:13,837 INFO ]: Start difference. First operand 40 states and 60 transitions. Second operand 5 states. [2018-06-22 11:13:13,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:13,925 INFO ]: Finished difference Result 26 states and 42 transitions. [2018-06-22 11:13:13,925 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:13:13,925 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:13:13,925 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:13,925 INFO ]: With dead ends: 26 [2018-06-22 11:13:13,925 INFO ]: Without dead ends: 0 [2018-06-22 11:13:13,925 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:13,925 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:13:13,925 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:13:13,925 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:13:13,925 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:13:13,925 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:13:13,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:13,925 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:13:13,925 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:13:13,925 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:13:13,925 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:13:13,929 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:13:13 BoogieIcfgContainer [2018-06-22 11:13:13,929 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:13:13,930 INFO ]: Toolchain (without parser) took 43968.79 ms. Allocated memory was 303.6 MB in the beginning and 574.1 MB in the end (delta: 270.5 MB). Free memory was 231.0 MB in the beginning and 331.6 MB in the end (delta: -100.6 MB). Peak memory consumption was 169.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:13,930 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:13:13,930 INFO ]: ChcToBoogie took 77.28 ms. Allocated memory is still 303.6 MB. Free memory was 231.0 MB in the beginning and 228.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:13,931 INFO ]: Boogie Preprocessor took 76.72 ms. Allocated memory is still 303.6 MB. Free memory was 228.1 MB in the beginning and 224.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:13,931 INFO ]: RCFGBuilder took 1383.78 ms. Allocated memory was 303.6 MB in the beginning and 321.4 MB in the end (delta: 17.8 MB). Free memory was 224.1 MB in the beginning and 280.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 46.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:13,931 INFO ]: TraceAbstraction took 42421.98 ms. Allocated memory was 321.4 MB in the beginning and 574.1 MB in the end (delta: 252.7 MB). Free memory was 279.0 MB in the beginning and 331.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 200.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:13,933 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 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.28 ms. Allocated memory is still 303.6 MB. Free memory was 231.0 MB in the beginning and 228.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 76.72 ms. Allocated memory is still 303.6 MB. Free memory was 228.1 MB in the beginning and 224.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1383.78 ms. Allocated memory was 303.6 MB in the beginning and 321.4 MB in the end (delta: 17.8 MB). Free memory was 224.1 MB in the beginning and 280.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 46.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 42421.98 ms. Allocated memory was 321.4 MB in the beginning and 574.1 MB in the end (delta: 252.7 MB). Free memory was 279.0 MB in the beginning and 331.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 200.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 42.3s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4172 SDtfs, 358 SDslu, 3097 SDs, 0 SdLazy, 14759 SolverSat, 1743 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 244 SyntacticMatches, 7 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=24, 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: 1.2s AutomataMinimizationTime, 55 MinimizatonAttempts, 964 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 1044 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 980 ConstructedInterpolants, 0 QuantifiedInterpolants, 42252 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1135 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 64 InterpolantComputations, 47 PerfectInterpolantSequences, 479/537 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-13-13-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-13-13-941.csv Received shutdown request...